default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIWOCA 2015: Verona, Italy
- Zsuzsanna Lipták, William F. Smyth:
Combinatorial Algorithms - 26th International Workshop, IWOCA 2015, Verona, Italy, October 5-7, 2015, Revised Selected Papers. Lecture Notes in Computer Science 9538, Springer 2016, ISBN 978-3-319-29515-2 - Mohammed Amin Abdullah, Colin Cooper, Moez Draief:
Speeding Up Cover Time of Sparse Graphs Using Local Knowledge. 1-12 - Hasna Mohsen Alqahtani, Thomas Erlebach:
Minimum Activation Cost Edge-Disjoint Paths in Graphs with Bounded Tree-Width. 13-24 - Stepan Artamonov, Maxim A. Babenko:
A Fast Scaling Algorithm for the Weighted Triangle-Free 2-Matching Problem. 25-37 - Carla Binucci
, Emilio Di Giacomo, Md. Iqbal Hossain, Giuseppe Liotta:
1-Page and 2-Page Drawings with Bounded Number of Crossings per Edge. 38-51 - Francine Blanchet-Sadri, Rachel Harred, Justin Lazarow:
Longest Common Extensions in Partial Words. 52-64 - Joan Boyar, Christian Kudahl:
Adding Isolated Vertices Makes Some Online Algorithms Optimal. 65-76 - Jou-Ming Chang, Ton Kloks, Hung-Lung Wang:
Gray Codes for AT-Free Orders via Antimatroids. 77-87 - Alessio Conte, Roberto Grossi, Andrea Marino, Romeo Rizzi:
Enumerating Cyclic Orientations of a Graph. 88-99 - Konrad Kazimierz Dabrowski, François Dross, Matthew Johnson, Daniël Paulusma:
Filling the Complexity Gaps for Colouring Planar and Bounded Degree Graphs. 100-111 - Irving Dai:
Combinatorial Properties of Full-Flag Johnson Graphs. 112-123 - Martin Derka, Alejandro López-Ortiz, Daniela Maftuleac:
List Colouring and Partial List Colouring of Graphs On-line. 124-135 - Gabriele Di Stefano, Pietro Montanari, Alfredo Navarra:
About Ungatherability of Oblivious and Asynchronous Robots on Anonymous Rings. 136-147 - Gabriele Farina, Luigi Laura:
Dynamic Subtrees Queries Revisited: The Depth First Tour Tree. 148-160 - Luca Ferrari:
Schröder Partitions and Schröder Tableaux. 161-172 - Guillaume Fertin, Irena Rusu, Stéphane Vialette:
Algorithmic Aspects of the S-Labeling Problem. 173-184 - Daniel Freund, Matthias Poloczek, Daniel Reichman:
Contagious Sets in Dense Graphs. 185-196 - Philippe Gambette, Andreas D. M. Gunawan, Anthony Labarre, Stéphane Vialette, Louxin Zhang:
Solving the Tree Containment Problem for Genetically Stable Networks in Quadratic Time. 197-208 - Eduard Eiben, Robert Ganian, Juho Lauri:
On the Complexity of Rainbow Coloring Problems. 209-220 - Frédéric Giroire, Stéphane Pérennes, Issam Tahiri:
How to Design Graphs with Low Forwarding Index and Limited Number of Edges. 221-234 - Petr A. Golovach, Pinar Heggernes, Dieter Kratsch:
Enumeration and Maximum Number of Minimal Connected Vertex Covers in Graphs. 235-247 - Myoungji Han, Munseong Kang, Sukhyeun Cho, Geonmo Gu, Jeong Seop Sim, Kunsoo Park:
Fast Multiple Order-Preserving Matching Algorithms. 248-259 - Toru Hasunuma:
Minimum Degree Conditions and Optimal Graphs for Completely Independent Spanning Trees. 260-273 - Klaus Jansen, Stefan Erich Julius Kraft:
A Faster FPTAS for the Unbounded Knapsack Problem. 274-286 - Dusan Knop, Tomás Masarík:
Computational Complexity of Distance Edge Labeling. 287-298 - Reuven Bar-Yehuda, Gilad Kutiel, Dror Rawitz:
1.5-Approximation Algorithm for the 2-Convex Recoloring Problem. 299-311 - Felipe A. Louza, Guilherme P. Telles:
Computing the BWT and the LCP Array in Constant Space. 312-320 - Mikhail Rubinchik, Arseny M. Shur:
EERTREE: An Efficient Data Structure for Processing Palindromes in Strings. 321-333 - Denys Shcherbak, Gerold Jäger, Lars-Daniel Öhman:
On the Zero Forcing Number of Bijection Graphs. 334-345 - Meirav Zehavi:
The k-Leaf Spanning Tree Problem Admits a Klam Value of 39. 346-357
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-01-24 17:15 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:
