IWOCA C

36 papers

YearTitle / Authors
2016A Bit-Scaling Algorithm for Integer Feasibility in UTVPI Constraints.
K. Subramani, Piotr Wojciechowski
2016A Boundary Property for Upper Domination.
Hassan AbouEisha, Shahid Hussain, Vadim V. Lozin, Jérôme Monnot, Bernard Ries, Victor Zamaraev
2016Advice Complexity of the Online Search Problem.
Jhoirene B. Clemente, Juraj Hromkovic, Dennis Komm, Christian Kudahl
2016Bounded Embeddings of Graphs in the Plane.
Radoslav Fulek
2016Combinatorial Algorithms - 27th International Workshop, IWOCA 2016, Helsinki, Finland, August 17-19, 2016, Proceedings
Veli Mäkinen, Simon J. Puglisi, Leena Salmela
2016Computing Giant Graph Diameters.
Peter Damaschke
2016Crushing Disks Efficiently.
Stefan Funke, Filip Krumpe, Sabine Storandt
2016Directing Road Networks by Listing Strong Orientations.
Alessio Conte, Roberto Grossi, Andrea Marino, Romeo Rizzi, Luca Versari
2016Distance Queries in Large-Scale Fully Dynamic Complex Networks.
Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni
2016Essential Constraints of Edge-Constrained Proximity Graphs.
Prosenjit Bose, Jean-Lou De Carufel, Alina Shaikhet, Michiel H. M. Smid
2016Evangelism in Social Networks.
Gennaro Cordasco, Luisa Gargano, Adele A. Rescigno, Ugo Vaccaro
2016Exact Algorithms for Weighted Coloring in Special Classes of Tree and Cactus Graphs.
Robert Benkoczi, Ram Dahal, Daya Ram Gaur
2016Faster Computation of Path-Width.
Martin Fürer
2016Finding Cactus Roots in Polynomial Time.
Petr A. Golovach, Dieter Kratsch, Daniël Paulusma, Anthony Stewart
2016Finding Gapped Palindromes Online.
Yuta Fujishige, Michitaro Nakamura, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2016Limits of Greedy Approximation Algorithms for the Maximum Planar Subgraph Problem.
Markus Chimani, Ivo Hedtke, Tilo Wiedera
2016Linear Time Algorithms for Happy Vertex Coloring Problems for Trees.
N. R. Aravind, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare
2016Minimax Regret 1-Median Problem in Dynamic Path Networks.
Yuya Higashikawa, Siu-Wing Cheng, Tsunehiko Kameda, Naoki Katoh, Shun Saburi
2016Monotone Paths in Geometric Triangulations.
Adrian Dumitrescu, Ritankar Mandal, Csaba D. Tóth
2016On Computing the Total Displacement Number via Weighted Motzkin Paths.
Andreas Bärtschi, Barbara Geissmann, Daniel Graf, Tomas Hruz, Paolo Penna, Thomas Tschager
2016On Maximal Chain Subgraphs and Covers of Bipartite Graphs.
Tiziana Calamoneri, Mattia Gastaldello, Arnaud Mary, Marie-France Sagot, Blerina Sinaimeri
2016On the Complexity of Computing Treebreadth.
Guillaume Ducoffe, Sylvain Legay, Nicolas Nisse
2016Online Chromatic Number is PSPACE-Complete.
Martin Böhm, Pavel Veselý
2016Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing.
Takuya Takagi, Shunsuke Inenaga, Kunihiko Sadakane, Hiroki Arimura
2016Partial Covering Arrays: Algorithms and Asymptotics.
Kaushik Sarkar, Charles J. Colbourn, Annalisa De Bonis, Ugo Vaccaro
2016Plane Bichromatic Trees of Low Degree.
Ahmad Biniaz, Prosenjit Bose, Anil Maheshwari, Michiel H. M. Smid
2016Querying Probabilistic Neighborhoods in Spatial Data Sets Efficiently.
Moritz von Looz, Henning Meyerhenke
2016Reconfiguration of Steiner Trees in an Unweighted Graph.
Haruka Mizuta, Takehiro Ito, Xiao Zhou
2016SOBRA - Shielding Optimization for BRAchytherapy.
Guillaume Blin, Marie Gasparoux, Sebastian Ordyniak, Alexandru Popa
2016Speeding up Dynamic Programming in the Line-Constrained k-median.
Pawel Gawrychowski, Lukasz Zatorski
2016Sufficient Conditions for Tuza's Conjecture on Packing and Covering Triangles.
Xujin Chen, Zhuo Diao, Xiao-Dong Hu, Zhongzheng Tang
2016The Solution Space of Sorting with Recurring Comparison Faults.
Peter Damaschke
2016Upper Domination: Complexity and Approximation.
Cristina Bazgan, Ljiljana Brankovic, Katrin Casel, Henning Fernau, Klaus Jansen, Kim-Manuel Klein, Michael Lampis, Mathieu Liedloff, Jérôme Monnot, Vangelis Th. Paschos
2016Weighted Online Problems with Advice.
Joan Boyar, Lene M. Favrholdt, Christian Kudahl, Jesper W. Mikkelsen
2016Weighted de Bruijn Graphs for the Menage Problem and Its Generalizations.
Max A. Alekseyev
2016Well-Quasi-Ordering versus Clique-Width: New Results on Bigenic Classes.
Konrad K. Dabrowski, Vadim V. Lozin, Daniël Paulusma