default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIWOCA 2010: London, UK
- Costas S. Iliopoulos, William F. Smyth:
Combinatorial Algorithms - 21st International Workshop, IWOCA 2010, London, UK, July 26-28, 2010, Revised Selected Papers. Lecture Notes in Computer Science 6460, Springer 2011, ISBN 978-3-642-19221-0 - Konrad K. Dabrowski
, Vadim V. Lozin, Haiko Müller, Dieter Rautenbach:
Parameterized Algorithms for the Independent Set Problem in Some Hereditary Graph Classes. 1-9 - Maxime Crochemore, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
On the Maximal Sum of Exponents of Runsin a String. 10-19 - Ulrik Brandes, Sabine Cornelsen, Barbara Pampel, Arnaud Sallaberry:
Path-Based Supports for Hypergraphs. 20-33 - Konstanty Junosza-Szaniawski, Pawel Rzazewski:
On Improved Exact Algorithms for L(2, 1)-Labeling of Graphs. 34-37 - Robert Ganian:
Thread Graphs, Linear Rank-Width and Their Algorithmic Applications. 38-42 - Francine Blanchet-Sadri, Bob Chen, Aleksandar Chakarov:
Minimum Number of Holes in Unavoidable Sets of Partial Words of Size Three. 43-55 - Marcin Kaminski, Paul Medvedev, Martin Milanic:
Shortest Paths between Shortest Paths and Independent Sets. 56-67 - Yusaku Kaneta, Hiroki Arimura:
Faster Bit-Parallel Algorithms for Unordered Pseudo-tree Matching and Tree Homeomorphism. 68-81 - Martin Kochol, Riste Skrekovski:
Dichotomy for Coloring of Dart Graphs. 82-89 - Djamal Belazzougui:
Worst Case Efficient Single and Multiple String Matching in the RAM Model. 90-102 - Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno:
The (2, 1)-Total Labeling Number of Outerplanar Graphs Is at Most Δ + 2. 103-106 - Desh Ranjan, John E. Savage, Mohammad Zubair:
Upper and Lower I/O Bounds for Pebbling r-Pyramids. 107-120 - Vladimir Estivill-Castro, Mahdi Parsa:
Single Parameter FPT-Algorithms for Non-trivial Games. 121-124 - Paul S. Bonsma, Hajo Broersma, Viresh Patel, Artem V. Pyatkin:
The Complexity Status of Problems Related to Sparsest Cuts. 125-135 - Mathias Hauptmann, Richard Schmied, Claus Viehmann:
On Approximation Complexity of Metric Dimension Problem. 136-139 - Alfredo Navarra, Maria Cristina Pinotti:
Collision-Free Routing in Sink-Centric Sensor Networks with Coarse-Grain Coordinates. 140-153 - Cristina Bazgan, Sonia Toubaline, Zsolt Tuza:
Complexity of Most Vital Nodes for Independent Set in Graphs Related to Tree Structures. 154-166 - Pinar Heggernes, Pim van 't Hof, Daniël Paulusma:
Computing Role Assignments of Proper Interval Graphs in Polynomial Time. 167-180 - Tomás Dvorák, Jirí Fink, Petr Gregor, Václav Koubek, Tomasz Radzik:
Efficient Connectivity Testing of Hypercubic Networks with Faults. 181-191 - Martin Kochol, Nad'a Krivonáková, Silvia Smejová, Katarína Sranková:
Reductions of Matrices Associated with Nowhere-Zero Flows. 192-200 - Ulrik Brandes, Sabine Cornelsen, Barbara Pampel, Arnaud Sallaberry:
Blocks of Hypergraphs - Applied to Hypergraphs and Outerplanarity. 201-211 - Patrizio Angelini, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Ignaz Rutter:
Testing the Simultaneous Embeddability of Two Graphs Whose Intersection Is a Biconnected Graph or a Tree. 212-225 - Prosenjit Bose, Karim Douïeb, Pat Morin:
Skip Lift: A Probabilistic Alternative to Red-Black Trees. 226-237 - Oudone Phanalasy, Mirka Miller, Leanne Rylands, Paulette Lieby:
On a Relationship between Completely Separating Systems and Antimagic Labeling of Regular Graphs. 238-241 - Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi, Yuri Pirola:
Parameterized Complexity of k-Anonymity: Hardness and Tractability. 242-255 - Zareen Alamgir, Saira Karim, Syed Husnine:
On Fast Enumeration of Pseudo Bicliques. 256-259 - Julien Allali, Cédric Chauve, Pascal Ferraro, Anne-Laure Gaillard:
Efficient Chaining of Seeds in Ordered Trees. 260-273 - Boris Horvat, Jan Kratochvíl, Tomaz Pisanski:
On the Computational Complexity of Degenerate Unit Distance Representations of Graphs. 274-285 - Maw-Shang Chang, Ling-Ju Hung:
Recognition of Probe Ptolemaic Graphs - (Extended Abstract). 286-290 - Ferdinando Cicalese, Martin Milanic:
Graphs of Separability at Most Two: Structural Characterizations and Their Consequences. 291-302 - Joe Ryan, Oudone Phanalasy, Mirka Miller, Leanne Rylands:
On Antimagic Labeling for Generalized Web and Flower Graphs. 303-313 - Tugkan Batu, Petra Berenbrink, Colin Cooper:
Chains-into-Bins Processes. 314-325 - Bernard Lidický, Marek Tesar:
Complexity of Locally Injective Homomorphism to the Theta Graphs. 326-336 - Henning Fernau, Fedor V. Fomin, Daniel Lokshtanov, Matthias Mnich, Geevarghese Philip, Saket Saurabh:
Ranking and Drawing in Subexponential Time. 337-348 - Ferdinando Cicalese, Péter L. Erdös, Zsuzsanna Lipták:
Efficient Reconstruction of RC-Equivalent Strings. 349-362 - Danny Z. Chen, Haitao Wang:
Improved Points Approximation Algorithms Based on Simplicial Thickness Data Structures. 363-376 - Mohammed Amin Abdullah, Colin Cooper, Tomasz Radzik:
The Cover Time of Cartesian Product Graphs. 377-389 - Maxime Crochemore, Laura Giambruno, Alessio Langiu, Filippo Mignosi, Antonio Restivo:
Dictionary-Symbolwise Flexible Parsing. 390-403 - Gregory Kucherov, Tamar Pinhas, Michal Ziv-Ukelson:
Regular Language Constrained Sequence Alignment Revisited. 404-415
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 2026-05-18 23:23 CEST 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:
