|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 283 occurrences of 173 keywords
|
|
|
Results
Found 1343 publication records. Showing 1343 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
1 | Thiago Braga Marcilon, Samuel Nascimento, Rudini M. Sampaio |
The Maximum Time of 2-Neighbour Bootstrap Percolation: Complexity Results. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science - 40th International Workshop, WG 2014, Nouan-le-Fuzelier, France, June 25-27, 2014. Revised Selected Papers, pp. 372-383, 2014, Springer, 978-3-319-12339-4. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
1 | Sigve Hortemo Sæther, Jan Arne Telle |
Between Treewidth and Clique-Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science - 40th International Workshop, WG 2014, Nouan-le-Fuzelier, France, June 25-27, 2014. Revised Selected Papers, pp. 396-407, 2014, Springer, 978-3-319-12339-4. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
1 | Radoslav Fulek |
Towards the Hanani-Tutte Theorem for Clustered Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science - 40th International Workshop, WG 2014, Nouan-le-Fuzelier, France, June 25-27, 2014. Revised Selected Papers, pp. 176-188, 2014, Springer, 978-3-319-12339-4. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
1 | Isolde Adler, Mamadou Moustapha Kanté, O-joung Kwon |
Linear Rank-Width of Distance-Hereditary Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science - 40th International Workshop, WG 2014, Nouan-le-Fuzelier, France, June 25-27, 2014. Revised Selected Papers, pp. 42-55, 2014, Springer, 978-3-319-12339-4. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
1 | Reinhard Diestel, Sang-il Oum |
Unifying Duality Theorems for Width Parameters in Graphs and Matroids (Extended Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science - 40th International Workshop, WG 2014, Nouan-le-Fuzelier, France, June 25-27, 2014. Revised Selected Papers, pp. 1-14, 2014, Springer, 978-3-319-12339-4. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
1 | Eric Aaron, Danny Krizanc, Elliot Meyerson |
DMVP: Foremost Waypoint Coverage of Time-Varying Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science - 40th International Workshop, WG 2014, Nouan-le-Fuzelier, France, June 25-27, 2014. Revised Selected Papers, pp. 29-41, 2014, Springer, 978-3-319-12339-4. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
1 | Van Bang Le, Andrea Oversberg, Oliver Schaudt |
Polynomial Time Recognition of Squares of Ptolemaic Graphs and 3-sun-free Split Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science - 40th International Workshop, WG 2014, Nouan-le-Fuzelier, France, June 25-27, 2014. Revised Selected Papers, pp. 360-371, 2014, Springer, 978-3-319-12339-4. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
1 | Falk Hüffner, Christian Komusiewicz, Rolf Niedermeier, Martin Rötzschke |
The Parameterized Complexity of the Rainbow Subgraph Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science - 40th International Workshop, WG 2014, Nouan-le-Fuzelier, France, June 25-27, 2014. Revised Selected Papers, pp. 287-298, 2014, Springer, 978-3-319-12339-4. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
1 | Thomas Erlebach, Michael Hoffmann 0002 |
Minimum Spanning Tree Verification Under Uncertainty. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science - 40th International Workshop, WG 2014, Nouan-le-Fuzelier, France, June 25-27, 2014. Revised Selected Papers, pp. 164-175, 2014, Springer, 978-3-319-12339-4. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
1 | Dieter Kratsch, Ioan Todinca (eds.) |
Graph-Theoretic Concepts in Computer Science - 40th International Workshop, WG 2014, Nouan-le-Fuzelier, France, June 25-27, 2014. Revised Selected Papers ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![Springer, 978-3-319-12339-4 The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
1 | Michel Habib, Antoine Mamcarz |
Colored Modular and Split Decompositions of Graphs with Applications to Trigraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science - 40th International Workshop, WG 2014, Nouan-le-Fuzelier, France, June 25-27, 2014. Revised Selected Papers, pp. 263-274, 2014, Springer, 978-3-319-12339-4. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
1 | Stéphan Thomassé, Nicolas Trotignon, Kristina Vuskovic |
A Polynomial Turing-Kernel for Weighted Independent Set in Bull-Free Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science - 40th International Workshop, WG 2014, Nouan-le-Fuzelier, France, June 25-27, 2014. Revised Selected Papers, pp. 408-419, 2014, Springer, 978-3-319-12339-4. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
1 | Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Christophe Paul |
Hadwiger Number of Graphs with Small Chordality. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science - 40th International Workshop, WG 2014, Nouan-le-Fuzelier, France, June 25-27, 2014. Revised Selected Papers, pp. 201-213, 2014, Springer, 978-3-319-12339-4. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
1 | Steven Chaplick, Paul Dorbec, Jan Kratochvíl, Mickaël Montassier, Juraj Stacho |
Contact Representations of Planar Graphs: Extending a Partial Representation is Hard. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science - 40th International Workshop, WG 2014, Nouan-le-Fuzelier, France, June 25-27, 2014. Revised Selected Papers, pp. 139-151, 2014, Springer, 978-3-319-12339-4. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
1 | Satoru Iwata 0001, Alantha Newman, R. Ravi 0001 |
Graph-TSP from Steiner Cycles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science - 40th International Workshop, WG 2014, Nouan-le-Fuzelier, France, June 25-27, 2014. Revised Selected Papers, pp. 312-323, 2014, Springer, 978-3-319-12339-4. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
1 | Petr A. Golovach, Daniël Paulusma, Erik Jan van Leeuwen |
Induced Disjoint Paths in Circular-Arc Graphs in Linear Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science - 40th International Workshop, WG 2014, Nouan-le-Fuzelier, France, June 25-27, 2014. Revised Selected Papers, pp. 225-237, 2014, Springer, 978-3-319-12339-4. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
1 | Gregory Z. Gutin, Mark Jones 0001, Bin Sheng 0002, Magnus Wahlström |
Parameterized Directed k-Chinese Postman Problem and k Arc-Disjoint Cycles Problem on Euler Digraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science - 40th International Workshop, WG 2014, Nouan-le-Fuzelier, France, June 25-27, 2014. Revised Selected Papers, pp. 250-262, 2014, Springer, 978-3-319-12339-4. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
1 | Hadas Shachnai, Meirav Zehavi |
Parameterized Algorithms for Graph Partitioning Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science - 40th International Workshop, WG 2014, Nouan-le-Fuzelier, France, June 25-27, 2014. Revised Selected Papers, pp. 384-395, 2014, Springer, 978-3-319-12339-4. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
1 | Eglantine Camby, Oliver Schaudt |
A New Characterization of Pk-free Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science - 40th International Workshop, WG 2014, Nouan-le-Fuzelier, France, June 25-27, 2014. Revised Selected Papers, pp. 129-138, 2014, Springer, 978-3-319-12339-4. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
1 | Heger Arfaoui, Pierre Fraigniaud, David Ilcinkas, Fabien Mathieu |
Distributedly Testing Cycle-Freeness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science - 40th International Workshop, WG 2014, Nouan-le-Fuzelier, France, June 25-27, 2014. Revised Selected Papers, pp. 15-28, 2014, Springer, 978-3-319-12339-4. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
1 | Henning Bruhn, Morgan Chopin, Felix Joos, Oliver Schaudt |
Structural Parameterizations for Boxicity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science - 40th International Workshop, WG 2014, Nouan-le-Fuzelier, France, June 25-27, 2014. Revised Selected Papers, pp. 117-128, 2014, Springer, 978-3-319-12339-4. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
1 | Aistis Atminas, Andrew Collins 0004, Jan Foniok, Vadim V. Lozin |
Deciding the Bell Number for Hereditary Graph Properties - (Extended Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science - 40th International Workshop, WG 2014, Nouan-le-Fuzelier, France, June 25-27, 2014. Revised Selected Papers, pp. 69-80, 2014, Springer, 978-3-319-12339-4. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
1 | Ragnar Nevries, Christian Rosenke |
Characterizing and Computing the Structure of Clique Intersections in Strongly Chordal Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science - 39th International Workshop, WG 2013, Lübeck, Germany, June 19-21, 2013, Revised Papers, pp. 382-393, 2013, Springer, 978-3-642-45042-6. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Christopher Auer, Christian Bachmaier, Franz-Josef Brandenburg, Kathrin Hanauer |
Rolling Upward Planarity Testing of Strongly Connected Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science - 39th International Workshop, WG 2013, Lübeck, Germany, June 19-21, 2013, Revised Papers, pp. 38-49, 2013, Springer, 978-3-642-45042-6. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | René van Bevern, Andreas Emil Feldmann, Manuel Sorge, Ondrej Suchý |
On the Parameterized Complexity of Computing Graph Bisections. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science - 39th International Workshop, WG 2013, Lübeck, Germany, June 19-21, 2013, Revised Papers, pp. 76-87, 2013, Springer, 978-3-642-45042-6. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Feodor F. Dragan |
Tree-Like Structures in Graphs: A Metric Point of View. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science - 39th International Workshop, WG 2013, Lübeck, Germany, June 19-21, 2013, Revised Papers, pp. 1-4, 2013, Springer, 978-3-642-45042-6. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Md. Jawaherul Alam, Steven Chaplick, Gasper Fijavz, Michael Kaufmann 0001, Stephen G. Kobourov, Sergey Pupyrev |
Threshold-Coloring and Unit-Cube Contact Representation of Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science - 39th International Workshop, WG 2013, Lübeck, Germany, June 19-21, 2013, Revised Papers, pp. 26-37, 2013, Springer, 978-3-642-45042-6. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Manfred Cochefert, Jean-François Couturier 0001, Petr A. Golovach, Dieter Kratsch, Daniël Paulusma |
Sparse Square Roots. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science - 39th International Workshop, WG 2013, Lübeck, Germany, June 19-21, 2013, Revised Papers, pp. 177-188, 2013, Springer, 978-3-642-45042-6. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Frank Kammer |
A Linear-Time Kernelization for the Rooted k-Leaf Outbranching Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science - 39th International Workshop, WG 2013, Lübeck, Germany, June 19-21, 2013, Revised Papers, pp. 310-320, 2013, Springer, 978-3-642-45042-6. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Stephane Durocher, Ellen Gethner, Debajyoti Mondal |
Thickness and Colorability of Geometric Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science - 39th International Workshop, WG 2013, Lübeck, Germany, June 19-21, 2013, Revised Papers, pp. 237-248, 2013, Springer, 978-3-642-45042-6. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Steven Chaplick, Stephen G. Kobourov, Torsten Ueckerdt |
Equilateral L-Contact Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science - 39th International Workshop, WG 2013, Lübeck, Germany, June 19-21, 2013, Revised Papers, pp. 139-151, 2013, Springer, 978-3-642-45042-6. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Prosenjit Bose, Pat Morin, André van Renssen, Sander Verdonschot |
The θ 5-Graph is a Spanner. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science - 39th International Workshop, WG 2013, Lübeck, Germany, June 19-21, 2013, Revised Papers, pp. 100-114, 2013, Springer, 978-3-642-45042-6. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Kathrin Hanauer, Franz-Josef Brandenburg, Christopher Auer |
Tight Upper Bounds for Minimum Feedback Arc Sets of Regular Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science - 39th International Workshop, WG 2013, Lübeck, Germany, June 19-21, 2013, Revised Papers, pp. 298-309, 2013, Springer, 978-3-642-45042-6. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Kurt Mehlhorn, Adrian Neumann, Jens M. Schmidt |
Certifying 3-Edge-Connectivity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science - 39th International Workshop, WG 2013, Lübeck, Germany, June 19-21, 2013, Revised Papers, pp. 358-369, 2013, Springer, 978-3-642-45042-6. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Marc Gillé |
OBDD-Based Representation of Interval Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science - 39th International Workshop, WG 2013, Lübeck, Germany, June 19-21, 2013, Revised Papers, pp. 286-297, 2013, Springer, 978-3-642-45042-6. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Luérbio Faria, Celina M. H. de Figueiredo, R. Bruce Richter, Imrich Vrto |
The Same Upper Bound for Both: The 2-Page and the Rectilinear Crossing Numbers of the n-Cube. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science - 39th International Workshop, WG 2013, Lübeck, Germany, June 19-21, 2013, Revised Papers, pp. 249-260, 2013, Springer, 978-3-642-45042-6. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Ola Svensson |
Overview of New Approaches for Approximating TSP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science - 39th International Workshop, WG 2013, Lübeck, Germany, June 19-21, 2013, Revised Papers, pp. 5-11, 2013, Springer, 978-3-642-45042-6. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Jan Arne Telle, Yngve Villanger |
Connecting Terminals and 2-Disjoint Connected Subgraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science - 39th International Workshop, WG 2013, Lübeck, Germany, June 19-21, 2013, Revised Papers, pp. 418-428, 2013, Springer, 978-3-642-45042-6. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Christine T. Cheng, Andrew McConvey, Drew Onderko, Nathaniel Shar, Charles Tomlinson |
Beyond Knights and Knaves. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science - 39th International Workshop, WG 2013, Lübeck, Germany, June 19-21, 2013, Revised Papers, pp. 394-405, 2013, Springer, 978-3-642-45042-6. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Tomasz Krawczyk, Arkadiusz Pawlik, Bartosz Walczak |
Coloring Triangle-Free Rectangular Frame Intersection Graphs with O(loglogn) Colors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science - 39th International Workshop, WG 2013, Lübeck, Germany, June 19-21, 2013, Revised Papers, pp. 333-344, 2013, Springer, 978-3-642-45042-6. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Ton Kloks, Yue-Li Wang |
On Retracts, Absolute Retracts, and Folds in Cographs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science - 39th International Workshop, WG 2013, Lübeck, Germany, June 19-21, 2013, Revised Papers, pp. 321-332, 2013, Springer, 978-3-642-45042-6. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Arman Boyaci, Tínaz Ekim, Mordechai Shalom, Shmuel Zaks |
Graphs of Edge-Intersecting Non-splitting Paths in a Tree: Towards Hole Representations - (Extended Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science - 39th International Workshop, WG 2013, Lübeck, Germany, June 19-21, 2013, Revised Papers, pp. 115-126, 2013, Springer, 978-3-642-45042-6. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Jianer Chen, Jia-Hao Fan, Sing-Hoi Sze |
Parameterized and Approximation Algorithms for the MAF Problem in Multifurcating Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science - 39th International Workshop, WG 2013, Lübeck, Germany, June 19-21, 2013, Revised Papers, pp. 152-164, 2013, Springer, 978-3-642-45042-6. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Hans L. Bodlaender, Stefan Kratsch, Vincent J. C. Kreuzen |
Fixed-Parameter Tractability and Characterizations of Small Special Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science - 39th International Workshop, WG 2013, Lübeck, Germany, June 19-21, 2013, Revised Papers, pp. 88-99, 2013, Springer, 978-3-642-45042-6. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Isolde Adler, Mamadou Moustapha Kanté |
Linear Rank-Width and Linear Clique-Width of Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science - 39th International Workshop, WG 2013, Lübeck, Germany, June 19-21, 2013, Revised Papers, pp. 12-25, 2013, Springer, 978-3-642-45042-6. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Konrad K. Dabrowski, Petr A. Golovach, Daniël Paulusma |
Colouring of Graphs with Ramsey-Type Forbidden Subgraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science - 39th International Workshop, WG 2013, Lübeck, Germany, June 19-21, 2013, Revised Papers, pp. 201-212, 2013, Springer, 978-3-642-45042-6. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Archontia C. Giannopoulou, Marcin Kaminski 0001, Dimitrios M. Thilikos |
Excluding Graphs as Immersions in Surface Embedded Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science - 39th International Workshop, WG 2013, Lübeck, Germany, June 19-21, 2013, Revised Papers, pp. 274-285, 2013, Springer, 978-3-642-45042-6. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Andreas Brandstädt, Klaus Jansen, Rüdiger Reischuk (eds.) |
Graph-Theoretic Concepts in Computer Science - 39th International Workshop, WG 2013, Lübeck, Germany, June 19-21, 2013, Revised Papers ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![Springer, 978-3-642-45042-6 The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Anne Berry, Annegret Wagler |
The Normal Graph Conjecture for Classes of Sparse Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science - 39th International Workshop, WG 2013, Lübeck, Germany, June 19-21, 2013, Revised Papers, pp. 64-75, 2013, Springer, 978-3-642-45042-6. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Lucila Maria Souza Bento, Davidson R. Boccardo, Raphael Carlos Santos Machado, Vinícius Gusmão Pereira de Sá, Jayme Luiz Szwarcfiter |
Towards a Provably Resilient Scheme for Graph-Based Watermarking. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science - 39th International Workshop, WG 2013, Lübeck, Germany, June 19-21, 2013, Revised Papers, pp. 50-63, 2013, Springer, 978-3-642-45042-6. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Neeldhara Misra, Fahad Panolan, Ashutosh Rai 0001, Venkatesh Raman 0001, Saket Saurabh 0001 |
Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science - 39th International Workshop, WG 2013, Lübeck, Germany, June 19-21, 2013, Revised Papers, pp. 370-381, 2013, Springer, 978-3-642-45042-6. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Hajo Broersma, Jirí Fiala 0001, Petr A. Golovach, Tomás Kaiser, Daniël Paulusma, Andrzej Proskurowski |
Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity of Interval Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science - 39th International Workshop, WG 2013, Lübeck, Germany, June 19-21, 2013, Revised Papers, pp. 127-138, 2013, Springer, 978-3-642-45042-6. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | André Schulz 0001 |
Drawing Graphs with Few Arcs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science - 39th International Workshop, WG 2013, Lübeck, Germany, June 19-21, 2013, Revised Papers, pp. 406-417, 2013, Springer, 978-3-642-45042-6. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Michael R. Fellows, Bart M. P. Jansen |
FPT Is Characterized by Useful Obstruction Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science - 39th International Workshop, WG 2013, Lübeck, Germany, June 19-21, 2013, Revised Papers, pp. 261-273, 2013, Springer, 978-3-642-45042-6. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Nina Chiarelli, Martin Milanic |
Linear Separation of Total Dominating Sets in Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science - 39th International Workshop, WG 2013, Lübeck, Germany, June 19-21, 2013, Revised Papers, pp. 165-176, 2013, Springer, 978-3-642-45042-6. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Nathan Lindzey, Ross M. McConnell |
On Finding Tucker Submatrices and Lekkerkerker-Boland Subgraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science - 39th International Workshop, WG 2013, Lübeck, Germany, June 19-21, 2013, Revised Papers, pp. 345-357, 2013, Springer, 978-3-642-45042-6. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Emilio Di Giacomo, Giuseppe Liotta, Tamara Mchedlidze |
Lower and Upper Bounds for Long Induced Paths in 3-Connected Planar Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science - 39th International Workshop, WG 2013, Lübeck, Germany, June 19-21, 2013, Revised Papers, pp. 213-224, 2013, Springer, 978-3-642-45042-6. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Kathryn Cook, Elaine M. Eschen, R. Sritharan, Xiaoqiang Wang 0005 |
Completing Colored Graphs to Meet a Target Property. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science - 39th International Workshop, WG 2013, Lübeck, Germany, June 19-21, 2013, Revised Papers, pp. 189-200, 2013, Springer, 978-3-642-45042-6. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Carola Doerr, G. Ramakrishna, Jens M. Schmidt |
Computing Minimum Cycle Bases in Weighted Partial 2-Trees in Linear Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science - 39th International Workshop, WG 2013, Lübeck, Germany, June 19-21, 2013, Revised Papers, pp. 225-236, 2013, Springer, 978-3-642-45042-6. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Christopher Auer, Christian Bachmaier, Franz-Josef Brandenburg, Andreas Gleißner, Kathrin Hanauer |
The Duals of Upward Planar Graphs on Cylinders. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science - 38th International Workshop, WG 2012, Jerusalem, Israel, June 26-28, 2012, Revised Selcted Papers, pp. 103-113, 2012, Springer, 978-3-642-34610-1. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Amitava Bhattacharya |
Alternating Reachability and Integer Sum of Closed Alternating Trails - The 3rd Annual Uri N. Peled Memorial Lecture. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science - 38th International Workshop, WG 2012, Jerusalem, Israel, June 26-28, 2012, Revised Selcted Papers, pp. 3, 2012, Springer, 978-3-642-34610-1. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Flavia Bonomo, Gianpaolo Oriolo, Claudia Snels |
Minimum Weighted Clique Cover on Strip-Composed Perfect Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science - 38th International Workshop, WG 2012, Jerusalem, Israel, June 26-28, 2012, Revised Selcted Papers, pp. 22-33, 2012, Springer, 978-3-642-34610-1. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Mathew C. Francis, Daniel Gonçalves 0001, Pascal Ochem |
The Maximum Clique Problem in Multiple Interval Graphs (Extended Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science - 38th International Workshop, WG 2012, Jerusalem, Israel, June 26-28, 2012, Revised Selcted Papers, pp. 57-68, 2012, Springer, 978-3-642-34610-1. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Pinar Heggernes, Pim van 't Hof, Dániel Marx, Neeldhara Misra, Yngve Villanger |
On the Parameterized Complexity of Finding Separators with Non-Hereditary Properties. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science - 38th International Workshop, WG 2012, Jerusalem, Israel, June 26-28, 2012, Revised Selcted Papers, pp. 332-343, 2012, Springer, 978-3-642-34610-1. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk |
On Group Feedback Vertex Set Parameterized by the Size of the Cutset. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science - 38th International Workshop, WG 2012, Jerusalem, Israel, June 26-28, 2012, Revised Selcted Papers, pp. 194-205, 2012, Springer, 978-3-642-34610-1. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Gilad Braunschvig, Shiri Chechik, David Peleg |
Fault Tolerant Additive Spanners. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science - 38th International Workshop, WG 2012, Jerusalem, Israel, June 26-28, 2012, Revised Selcted Papers, pp. 206-214, 2012, Springer, 978-3-642-34610-1. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Stefan Kratsch, Pascal Schweitzer |
Graph Isomorphism for Graph Classes Characterized by Two Forbidden Induced Subgraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science - 38th International Workshop, WG 2012, Jerusalem, Israel, June 26-28, 2012, Revised Selcted Papers, pp. 34-45, 2012, Springer, 978-3-642-34610-1. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani |
h-Quasi Planar Drawings of Bounded Treewidth Graphs in Linear Area. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science - 38th International Workshop, WG 2012, Jerusalem, Israel, June 26-28, 2012, Revised Selcted Papers, pp. 91-102, 2012, Springer, 978-3-642-34610-1. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Fredrik Manne, Daniël Paulusma, Michal Pilipczuk |
How to Eliminate a Graph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science - 38th International Workshop, WG 2012, Jerusalem, Israel, June 26-28, 2012, Revised Selcted Papers, pp. 320-331, 2012, Springer, 978-3-642-34610-1. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Robert H. Sloan, Despina Stasi, György Turán |
Hydras: Directed Hypergraphs and Horn Formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science - 38th International Workshop, WG 2012, Jerusalem, Israel, June 26-28, 2012, Revised Selcted Papers, pp. 237-248, 2012, Springer, 978-3-642-34610-1. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Vadim E. Levit, Martin Milanic, David Tankus |
On the Recognition of k-Equistable Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science - 38th International Workshop, WG 2012, Jerusalem, Israel, June 26-28, 2012, Revised Selcted Papers, pp. 286-296, 2012, Springer, 978-3-642-34610-1. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Pranabendu Misra, Venkatesh Raman 0001, M. S. Ramanujan 0001, Saket Saurabh 0001 |
Parameterized Algorithms for Even Cycle Transversal. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science - 38th International Workshop, WG 2012, Jerusalem, Israel, June 26-28, 2012, Revised Selcted Papers, pp. 172-183, 2012, Springer, 978-3-642-34610-1. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Leah Epstein, Asaf Levin, Gerhard J. Woeginger |
The (Weighted) Metric Dimension of Graphs: Hard and Easy Cases. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science - 38th International Workshop, WG 2012, Jerusalem, Israel, June 26-28, 2012, Revised Selcted Papers, pp. 114-125, 2012, Springer, 978-3-642-34610-1. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Daniel Berend, Amir Sapir |
Which Multi-peg Tower of Hanoi Problems Are Exponential? ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science - 38th International Workshop, WG 2012, Jerusalem, Israel, June 26-28, 2012, Revised Selcted Papers, pp. 81-90, 2012, Springer, 978-3-642-34610-1. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Jérôme Javelle, Mehdi Mhalla, Simon Perdrix |
On the Minimum Degree Up to Local Complementation: Bounds and Complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science - 38th International Workshop, WG 2012, Jerusalem, Israel, June 26-28, 2012, Revised Selcted Papers, pp. 138-147, 2012, Springer, 978-3-642-34610-1. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Martin Charles Golumbic, Michal Stern, Avivit Levy, Gila Morgenstern |
Student Poster Session. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science - 38th International Workshop, WG 2012, Jerusalem, Israel, June 26-28, 2012, Revised Selcted Papers, pp. 4-6, 2012, Springer, 978-3-642-34610-1. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Anne Berry, Annegret Wagler |
Triangulation and Clique Separator Decomposition of Claw-Free Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science - 38th International Workshop, WG 2012, Jerusalem, Israel, June 26-28, 2012, Revised Selcted Papers, pp. 7-21, 2012, Springer, 978-3-642-34610-1. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | David Peleg |
Constructing Resilient Structures in Graphs: Rigid vs. Competitive Fault-Tolerance. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science - 38th International Workshop, WG 2012, Jerusalem, Israel, June 26-28, 2012, Revised Selcted Papers, pp. 2, 2012, Springer, 978-3-642-34610-1. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Konstanty Junosza-Szaniawski, Jan Kratochvíl, Mathieu Liedloff, Pawel Rzazewski |
Determining the L(2, 1)-Span in Polynomial Space. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science - 38th International Workshop, WG 2012, Jerusalem, Israel, June 26-28, 2012, Revised Selcted Papers, pp. 126-137, 2012, Springer, 978-3-642-34610-1. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Haiko Müller |
On the Stable Degree of Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science - 38th International Workshop, WG 2012, Jerusalem, Israel, June 26-28, 2012, Revised Selcted Papers, pp. 148-159, 2012, Springer, 978-3-642-34610-1. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Neele Leithäuser, Sven Oliver Krumke, Maximilian Merkert |
Approximating Infeasible 2VPI-Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science - 38th International Workshop, WG 2012, Jerusalem, Israel, June 26-28, 2012, Revised Selcted Papers, pp. 225-236, 2012, Springer, 978-3-642-34610-1. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Sara Brunetti, Gennaro Cordasco, Luisa Gargano, Elena Lodi, Walter Quattrociocchi |
Minimum Weight Dynamo and Fast Opinion Spreading - (Extended Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science - 38th International Workshop, WG 2012, Jerusalem, Israel, June 26-28, 2012, Revised Selcted Papers, pp. 249-261, 2012, Springer, 978-3-642-34610-1. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Fanica Gavril |
Maximum Induced Multicliques and Complete Multipartite Subgraphs in Polygon-Circle Graphs and Circle Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science - 38th International Workshop, WG 2012, Jerusalem, Israel, June 26-28, 2012, Revised Selcted Papers, pp. 297-307, 2012, Springer, 978-3-642-34610-1. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Nicolas Bousquet, Daniel Gonçalves 0001, George B. Mertzios, Christophe Paul, Ignasi Sau, Stéphan Thomassé |
Parameterized Domination in Circle Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science - 38th International Workshop, WG 2012, Jerusalem, Israel, June 26-28, 2012, Revised Selcted Papers, pp. 308-319, 2012, Springer, 978-3-642-34610-1. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Martin Charles Golumbic, Michal Stern, Avivit Levy, Gila Morgenstern (eds.) |
Graph-Theoretic Concepts in Computer Science - 38th International Workshop, WG 2012, Jerusalem, Israel, June 26-28, 2012, Revised Selcted Papers ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![Springer, 978-3-642-34610-1 The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Danny Hermelin, Julián Mestre, Dror Rawitz |
Optimization Problems in Dotted Interval Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science - 38th International Workshop, WG 2012, Jerusalem, Israel, June 26-28, 2012, Revised Selcted Papers, pp. 46-56, 2012, Springer, 978-3-642-34610-1. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Tomoya Hibi, Toshihiro Fujito |
Multi-rooted Greedy Approximation of Directed Steiner Trees with Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science - 38th International Workshop, WG 2012, Jerusalem, Israel, June 26-28, 2012, Revised Selcted Papers, pp. 215-224, 2012, Springer, 978-3-642-34610-1. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Lukasz Kowalik, Marcin Mucha |
A 9k Kernel for Nonseparating Independent Set in Planar Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science - 38th International Workshop, WG 2012, Jerusalem, Israel, June 26-28, 2012, Revised Selcted Papers, pp. 160-171, 2012, Springer, 978-3-642-34610-1. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Dieter Rautenbach |
Account on Intervals. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science - 38th International Workshop, WG 2012, Jerusalem, Israel, June 26-28, 2012, Revised Selcted Papers, pp. 1, 2012, Springer, 978-3-642-34610-1. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Péter Biró 0001, Matthijs Bomhoff, Petr A. Golovach, Walter Kern, Daniël Paulusma |
Solutions for the Stable Roommates Problem with Payments. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science - 38th International Workshop, WG 2012, Jerusalem, Israel, June 26-28, 2012, Revised Selcted Papers, pp. 69-80, 2012, Springer, 978-3-642-34610-1. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Steven Chaplick, Vít Jelínek, Jan Kratochvíl, Tomás Vyskocil |
Bend-Bounded Path Intersection Graphs: Sausages, Noodles, and Waffles on a Grill. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science - 38th International Workshop, WG 2012, Jerusalem, Israel, June 26-28, 2012, Revised Selcted Papers, pp. 274-285, 2012, Springer, 978-3-642-34610-1. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Carmen Cecilia Centeno, Lucia Draque Penso, Dieter Rautenbach, Vinícius Gusmão Pereira de Sá |
Immediate versus Eventual Conversion: Comparing Geodetic and Hull Numbers in P 3-Convexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science - 38th International Workshop, WG 2012, Jerusalem, Israel, June 26-28, 2012, Revised Selcted Papers, pp. 262-273, 2012, Springer, 978-3-642-34610-1. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Matthias Mnich, Rico Zenklusen |
Bisections above Tight Lower Bounds. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science - 38th International Workshop, WG 2012, Jerusalem, Israel, June 26-28, 2012, Revised Selcted Papers, pp. 184-193, 2012, Springer, 978-3-642-34610-1. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Manuel Sorge, René van Bevern, Rolf Niedermeier, Mathias Weller |
From Few Components to an Eulerian Graph by Adding Arcs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science - 37th International Workshop, WG 2011, Teplá Monastery, Czech Republic, June 21-24, 2011. Revised Papers, pp. 307-318, 2011, Springer, 978-3-642-25869-5. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Jean-François Couturier 0001, Petr A. Golovach, Dieter Kratsch, Daniël Paulusma |
List Coloring in the Absence of a Linear Forest. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science - 37th International Workshop, WG 2011, Teplá Monastery, Czech Republic, June 21-24, 2011. Revised Papers, pp. 119-130, 2011, Springer, 978-3-642-25869-5. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Yota Otachi, Toshiki Saitoh, Katsuhisa Yamanaka, Shuji Kijima, Yoshio Okamoto, Hirotaka Ono 0001, Yushi Uno, Koichi Yamazaki |
Approximability of the Path-Distance-Width for AT-free Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science - 37th International Workshop, WG 2011, Teplá Monastery, Czech Republic, June 21-24, 2011. Revised Papers, pp. 271-282, 2011, Springer, 978-3-642-25869-5. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Iyad A. Kanj, Fenghui Zhang |
On the Independence Number of Graphs with Maximum Degree 3. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science - 37th International Workshop, WG 2011, Teplá Monastery, Czech Republic, June 21-24, 2011. Revised Papers, pp. 238-249, 2011, Springer, 978-3-642-25869-5. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Petr Kolman, Jan Kratochvíl (eds.) |
Graph-Theoretic Concepts in Computer Science - 37th International Workshop, WG 2011, Teplá Monastery, Czech Republic, June 21-24, 2011. Revised Papers ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![Springer, 978-3-642-25869-5 The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Ondrej Bílka, Jozef Jirásek 0002, Pavel Klavík, Martin Tancer, Jan Volec |
On the Complexity of Planar Covering of Small Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science - 37th International Workshop, WG 2011, Teplá Monastery, Czech Republic, June 21-24, 2011. Revised Papers, pp. 83-94, 2011, Springer, 978-3-642-25869-5. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Liliana Alcón, Luérbio Faria, Celina M. H. de Figueiredo, Marisa Gutierrez |
Split Clique Graph Complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science - 37th International Workshop, WG 2011, Teplá Monastery, Czech Republic, June 21-24, 2011. Revised Papers, pp. 11-22, 2011, Springer, 978-3-642-25869-5. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
Displaying result #301 - #400 of 1343 (100 per page; Change: ) Pages: [ <<][ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ 11][ 12][ 13][ >>] |
|