default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIWOCA 2009: Hradec nad Moravicí, Czech Republic
- Jirí Fiala, Jan Kratochvíl, Mirka Miller:
Combinatorial Algorithms, 20th International Workshop, IWOCA 2009, Hradec nad Moravicí, Czech Republic, June 28-July 2, 2009, Revised Selected Papers. Lecture Notes in Computer Science 5874, Springer 2009, ISBN 978-3-642-10216-5
Invited Talks
- Jack Edmonds:
Branching Systems. 1 - Michael R. Fellows
:
Towards Fully Multivariate Algorithmics: Some New Results and Directions in Parameter Ecology. 2-10 - Giovanni Manzini:
Succinct Representations of Trees. 11-18 - Robin Thomas:
Kt Minors in Large t-Connected Graphs. 19 - Sue Whitesides:
Intractability in Graph Drawing and Geometry: FPT Approaches. 20-23
Contributed Talks
- Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra:
Evaluation of Recoverable-Robust Timetables on Tree Networks. 24-35 - Amihood Amir, Zvi Gotthilf, B. Riva Shalom:
Weighted LCS. 36-47 - Nicola Apollonio, Massimiliano Caramia:
Integrality Properties of Certain Special Balanceable Families. 48-59 - N. R. Aravind, C. R. Subramanian:
Forbidden Subgraph Colorings and the Oriented Chromatic Number. 60-71 - Stéphane Bessy, Christophe Paul, Anthony Perez:
Polynomial Kernels for 3-Leaf Power Graph Modification Problems. 72-82 - Nicolas Bourgeois, Giorgio Lucarelli, Ioannis Milis, Vangelis Th. Paschos:
Approximating the Max Edge-Coloring Problem. 83-94 - Hajo Broersma, Fedor V. Fomin, Petr A. Golovach, Daniël Paulusma:
Three Complexity Results on Coloring Pk-Free Graphs. 95-104 - Hajo Broersma, Dieter Kratsch, Gerhard J. Woeginger:
Fully Decomposable Split Graphs. 105-112 - Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshelle:
Feedback Vertex Set on Graphs of Low Cliquewidth. 113-124 - Sylwia Cichacz, Dalibor Froncek, Petr Kovár:
Note on Decomposition of Kn, n into (0, j)-prisms. 125-133 - David Coudert, Frédéric Giroire, Ignasi Sau:
Edge-Simple Circuits through 10 Ordered Vertices in Square Grids. 134-145 - Christophe Crespelle, Philippe Gambette:
Efficient Neighborhood Encoding for Interval Graphs and Permutation Graphs and O(n) Breadth-First Search. 146-157 - Maxime Crochemore, Lucian Ilie, Costas S. Iliopoulos, Marcin Kubica, Wojciech Rytter, Tomasz Walen:
LPF Computation Revisited. 158-169 - Alexis Darrasse, Michèle Soria:
Limiting Distribution for Distances in k-Trees. 170-182 - Darko Dimitrov, Tomás Dvorák, Petr Gregor, Riste Skrekovski:
Gray Code Compression. 183-193 - Michael Drmota:
Embedded Trees and the Support of the ISE. 194-205 - Michael Drmota, Bernhard Gittenberger, Reinhard Kutzelnigg:
Combinatorial Models for Cooperation Networks. 206-217 - Tínaz Ekim, Pinar Heggernes, Daniel Meister:
Polar Permutation Graphs. 218-229 - Matteo Campanelli, Domenico Cantone, Simone Faro:
A New Algorithm for Efficient Pattern Matching with Swaps. 230-241 - Thomas Feierl:
The Height and Range of Watermelons without Wall. 242-253 - Kimmo Fredriksson, Szymon Grabowski:
Fast Convolutions and Their Applications in Approximate String Matching. 254-265 - Robert Ganian, Petr Hlinený:
Better Polynomial Algorithms on Graphs of Bounded Rank-Width. 266-277 - Pawel Gawrychowski, Travis Gagie:
Minimax Trees in Linear Time with Applications. 278-288 - Carsten Gutwenger, Petra Mutzel, Bernd Zey:
Planar Biconnectivity Augmentation with Fixed Embedding. 289-300 - Ling-Ju Hung, Ton Kloks, Chuan-Min Lee:
Trivially-Perfect Width. 301-311 - Tomohiro I, Satoshi Deguchi, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda:
Lightweight Parameterized Suffix Array Construction. 312-323 - Marián Klesc:
On the Crossing Numbers of Cartesian Products of Stars and Graphs on Five Vertices. 324-333 - Petr Kovár, Michael Kubesa:
Factorizations of Complete Graphs into Spanning Trees with All Possible Maximum Degrees. 334-344 - Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
On the Maximal Number of Cubic Subwords in a String. 345-355 - Josef Cibulka, Jan Kyncl, Viola Mészáros, Rudolf Stolar, Pavel Valtr:
Solution of Peter Winkler's Pizza Problem. 356-367 - Evaggelos Lappas, Stavros D. Nikolopoulos, Leonidas Palios:
An O(n)-Time Algorithm for the Paired-Domination Problem on Permutation Graphs. 368-379 - Daniel Lokshtanov, Saket Saurabh, Somnath Sikdar:
Simpler Parameterized Algorithm for OCT. 380-384 - Nicholas Korpelainen, Vadim V. Lozin:
Bipartite Graphs of Large Clique-Width. 385-395 - Paul D. Manuel, Indra Rajasingh, Bharati Rajan, Joice Punitha:
Kernel in Oriented Circulant Graphs. 396-407 - Peyman Nayeri, Charles J. Colbourn, Goran Konjevod:
Randomized Postoptimization of Covering Arrays. 408-419 - Petr Procházka, Jan Holub:
New Word-Based Adaptive Dense Compressors. 420-431 - Ingo Schiermeyer:
Rainbow Connection in Graphs with Minimum Degree Three. 432-437 - Edyta Szymanska:
The Complexity of Almost Perfect Matchings in Uniform Hypergraphs with High Codegree. 438-449 - Petr Skoda:
Computability of Width of Submodular Partition Functions. 450-459 - T. V. Thirumala Reddy, D. Sai Krishna, C. Pandu Rangan:
The Guarding Problem - Complexity and Approximation. 460-470 - Lubomir Torok, Imrich Vrto:
Antibandwidth of d-Dimensional Meshes. 471-477
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-22 20:19 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:
