default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIWOCA 2016: Helsinki, Finland
- Veli Mäkinen
, Simon J. Puglisi, Leena Salmela:
Combinatorial Algorithms - 27th International Workshop, IWOCA 2016, Helsinki, Finland, August 17-19, 2016, Proceedings. Lecture Notes in Computer Science 9843, Springer 2016, ISBN 978-3-319-44542-7
Computational Complexity
- Guillaume Ducoffe, Sylvain Legay, Nicolas Nisse:
On the Complexity of Computing Treebreadth. 3-15 - Martin Böhm, Pavel Veselý:
Online Chromatic Number is PSPACE-Complete. 16-28
Computational Geometry
- Radoslav Fulek:
Bounded Embeddings of Graphs in the Plane. 31-42 - Stefan Funke, Filip Krumpe, Sabine Storandt:
Crushing Disks Efficiently. 43-54 - Prosenjit Bose, Jean-Lou De Carufel, Alina Shaikhet, Michiel H. M. Smid:
Essential Constraints of Edge-Constrained Proximity Graphs. 55-67 - Ahmad Biniaz, Prosenjit Bose, Anil Maheshwari, Michiel H. M. Smid:
Plane Bichromatic Trees of Low Degree. 68-80
Networks
- Alessio Conte, Roberto Grossi, Andrea Marino, Romeo Rizzi, Luca Versari:
Directing Road Networks by Listing Strong Orientations. 83-95 - Gennaro Cordasco, Luisa Gargano, Adele A. Rescigno, Ugo Vaccaro:
Evangelism in Social Networks. 96-108 - Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni:
Distance Queries in Large-Scale Fully Dynamic Complex Networks. 109-121 - Yuya Higashikawa, Siu-Wing Cheng, Tsunehiko Kameda, Naoki Katoh, Shun Saburi:
Minimax Regret 1-Median Problem in Dynamic Path Networks. 122-134
Enumeration
- Tiziana Calamoneri, Mattia Gastaldello, Arnaud Mary, Marie-France Sagot, Blerina Sinaimeri:
On Maximal Chain Subgraphs and Covers of Bipartite Graphs. 137-150 - Max A. Alekseyev:
Weighted de Bruijn Graphs for the Menage Problem and Its Generalizations. 151-162 - Haruka Mizuta, Takehiro Ito, Xiao Zhou:
Reconfiguration of Steiner Trees in an Unweighted Graph. 163-175
Online Algorithms
- Joan Boyar, Lene M. Favrholdt, Christian Kudahl, Jesper W. Mikkelsen:
Weighted Online Problems with Advice. 179-190 - Yuta Fujishige, Michitaro Nakamura, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Finding Gapped Palindromes Online. 191-202 - Jhoirene B. Clemente, Juraj Hromkovic, Dennis Komm, Christian Kudahl:
Advice Complexity of the Online Search Problem. 203-212 - Takuya Takagi, Shunsuke Inenaga, Kunihiko Sadakane, Hiroki Arimura:
Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing. 213-225
Algorithmic Graph Theory
- Hassan AbouEisha, Shahid Hussain, Vadim V. Lozin, Jérôme Monnot, Bernard Ries, Victor Zamaraev:
A Boundary Property for Upper Domination. 229-240 - Cristina Bazgan, Ljiljana Brankovic, Katrin Casel, Henning Fernau, Klaus Jansen, Kim-Manuel Klein, Michael Lampis, Mathieu Liedloff, Jérôme Monnot, Vangelis Th. Paschos:
Upper Domination: Complexity and Approximation. 241-252 - Konrad K. Dabrowski, Vadim V. Lozin, Daniël Paulusma:
Well-Quasi-Ordering versus Clique-Width: New Results on Bigenic Classes. 253-265 - Xujin Chen, Zhuo Diao, Xiao-Dong Hu, Zhongzheng Tang:
Sufficient Conditions for Tuza's Conjecture on Packing and Covering Triangles. 266-277
Dynamic Programming
- N. R. Aravind, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare:
Linear Time Algorithms for Happy Vertex Coloring Problems for Trees. 281-292 - Pawel Gawrychowski, Lukasz Zatorski:
Speeding up Dynamic Programming in the Line-Constrained k-median. 293-305
Combinatorial Algorithms
- Guillaume Blin, Marie Gasparoux, Sebastian Ordyniak, Alexandru Popa:
SOBRA - Shielding Optimization for BRAchytherapy. 309-320 - K. Subramani, Piotr Wojciechowski:
A Bit-Scaling Algorithm for Integer Feasibility in UTVPI Constraints. 321-333 - Markus Chimani, Ivo Hedtke, Tilo Wiedera:
Limits of Greedy Approximation Algorithms for the Maximum Planar Subgraph Problem. 334-346 - Robert Benkoczi, Ram Dahal, Daya Ram Gaur:
Exact Algorithms for Weighted Coloring in Special Classes of Tree and Cactus Graphs. 347-358
Graph Algorithms
- Petr A. Golovach, Dieter Kratsch, Daniël Paulusma, Anthony Stewart:
Finding Cactus Roots in Polynomial Time. 361-372 - Peter Damaschke:
Computing Giant Graph Diameters. 373-384 - Martin Fürer:
Faster Computation of Path-Width. 385-396 - Peter Damaschke:
The Solution Space of Sorting with Recurring Comparison Faults. 397-408
Combinatorics
- Adrian Dumitrescu, Ritankar Mandal, Csaba D. Tóth:
Monotone Paths in Geometric Triangulations. 411-422 - Andreas Bärtschi, Barbara Geissmann, Daniel Graf, Tomas Hruz, Paolo Penna, Thomas Tschager:
On Computing the Total Displacement Number via Weighted Motzkin Paths. 423-434
Probabilistics
- Kaushik Sarkar, Charles J. Colbourn, Annalisa De Bonis, Ugo Vaccaro:
Partial Covering Arrays: Algorithms and Asymptotics. 437-448 - Moritz von Looz, Henning Meyerhenke:
Querying Probabilistic Neighborhoods in Spatial Data Sets Efficiently. 449-460
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-02-21 19:39 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
