The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications at "WG"( http://dblp.L3S.de/Venues/WG )

URL (DBLP): http://dblp.uni-trier.de/db/conf/wg

Publication years (Num. hits)
1975 (15) 1976-1980 (35) 1981 (31) 1982 (21) 1983 (33) 1984-1986 (25) 1987 (20) 1988 (32) 1989 (27) 1990 (27) 1991 (26) 1992 (30) 1993 (36) 1994 (33) 1995 (32) 1996 (31) 1997 (31) 1998 (31) 1999 (38) 2000 (29) 2001 (30) 2002 (37) 2003 (34) 2004 (34) 2005 (41) 2006 (32) 2007 (32) 2008 (34) 2009 (30) 2010 (32) 2011 (31) 2012 (34) 2013 (37) 2014 (35) 2015 (35) 2016 (27) 2017 (33) 2018 (31) 2019 (30) 2020 (33) 2021 (31) 2022 (33) 2023 (34)
Publication types (Num. hits)
inproceedings(1294) proceedings(49)
Venues (Conferences, Journals, ...)
WG(1343)
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
1Clément Dallard, Martin Milanic, Kenny Storgel Treewidth Versus Clique Number in Graph Classes with a Forbidden Structure. Search on Bibsonomy WG The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Jesper Nederlof, Michal Pilipczuk, Céline M. F. Swennenhuis, Karol Wegrzycki Hamiltonian Cycle Parameterized by Treedepth in Single Exponential Time and Polynomial Space. Search on Bibsonomy WG The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Irene Heinrich, Till Heller, Eva Schmidt, Manuel Streicher 2.5-Connectivity: Unique Components, Critical Graphs, and Applications. Search on Bibsonomy WG The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Manu Basavaraju, Arijit Bishnu, Mathew C. Francis, Drimit Pattanayak The Linear Arboricity Conjecture for 3-Degenerate Graphs. Search on Bibsonomy WG The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Paul Jungeblut, Torsten Ueckerdt Guarding Quadrangulations and Stacked Triangulations with Edges. Search on Bibsonomy WG The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Pavel Klavík, Dusan Knop, Peter Zeman 0001 Graph Isomorphism Restricted by Lists. Search on Bibsonomy WG The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Fabrizio Frati, Michael Hoffmann 0001, Csaba D. Tóth Universal Geometric Graphs. Search on Bibsonomy WG The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Therese Biedl, Fabian Klute Finding Large Matchings in 1-Planar Graphs of Minimum Degree 3. Search on Bibsonomy WG The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Yixin Cao 0001, Guozhen Rong, Jianxin Wang 0001 Characterization and Linear-Time Recognition of Paired Threshold Graphs. Search on Bibsonomy WG The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Shinya Fujita 0001, Boram Park, Tadashi Sakuma Stable Structure on Safe Set Problems in Vertex-Weighted Graphs II -Recognition and Complexity-. Search on Bibsonomy WG The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Isolde Adler, Haiko Müller (eds.) Graph-Theoretic Concepts in Computer Science - 46th International Workshop, WG 2020, Leeds, UK, June 24-26, 2020, Revised Selected Papers Search on Bibsonomy WG The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Nick Brettell, Matthew Johnson 0002, Giacomo Paesani, Daniël Paulusma Computing Subset Transversals in H-Free Graphs. Search on Bibsonomy WG The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Abu Reyan Ahmed, Greg Bodwin, Faryad Darabi Sahneh, Stephen G. Kobourov, Richard Spence Weighted Additive Spanners. Search on Bibsonomy WG The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Hans L. Bodlaender, Benjamin A. Burton, Fedor V. Fomin, Alexander Grigoriev Knot Diagrams of Treewidth Two. Search on Bibsonomy WG The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Marcel Milich, Torsten Mütze, Martin Pergel On Flips in Planar Matchings. Search on Bibsonomy WG The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Nina Chiarelli, Berenice Martínez-Barona, Martin Milanic, Jérôme Monnot, Peter Mursic Strong Cliques in Diamond-Free Graphs. Search on Bibsonomy WG The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Yusuke Kobayashi 0001, Yoshio Okamoto, Yota Otachi, Yushi Uno Linear-Time Recognition of Double-Threshold Graphs. Search on Bibsonomy WG The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Pavel Dvorák, Andreas Emil Feldmann, Ashutosh Rai 0001, Pawel Rzazewski Parameterized Inapproximability of Independent Set in H-Free Graphs. Search on Bibsonomy WG The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Rémy Belmonte, Ignasi Sau On the Complexity of Finding Large Odd Induced Subgraphs and Odd Colorings. Search on Bibsonomy WG The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Stefan Felsner, Kolja Knauer, Torsten Ueckerdt Plattenbauten: Touching Rectangles in Space. Search on Bibsonomy WG The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Mathew C. Francis, Rian Neogi, Venkatesh Raman 0001 Recognizing k-Clique Extendible Orderings. Search on Bibsonomy WG The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Jesse Beisegel, Nina Chiarelli, Ekkehard Köhler, Matjaz Krnc, Martin Milanic, Nevena Pivac, Robert Scheffler 0001, Martin Strehler 0001 Edge Elimination and Weighted Graph Classes. Search on Bibsonomy WG The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Parinya Chalermsook, Wanchote Po Jiamjitrak, Ly Orgo On Finding Balanced Bicliques via Matchings. Search on Bibsonomy WG The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Alan Arroyo, Fabian Klute, Irene Parada, Raimund Seidel, Birgit Vogtenhuber, Tilo Wiedera Inserting One Edge into a Simple Drawing Is Hard. Search on Bibsonomy WG The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Jungho Ahn, Lars Jaffke, O-joung Kwon, Paloma T. Lima Well-Partitioned Chordal Graphs: Obstruction Set and Disjoint Paths. Search on Bibsonomy WG The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Konrad K. Dabrowski, Tomás Masarík, Jana Novotná 0001, Daniël Paulusma, Pawel Rzazewski Clique-Width: Harnessing the Power of Atoms. Search on Bibsonomy WG The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Patrizio Angelini, Michael A. Bekos, Henry Förster, Martin Gronemann Bitonic st-Orderings for Upward Planar Graphs: The Variable Embedding Setting. Search on Bibsonomy WG The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Benjamin Bergougnoux, Charis Papadopoulos, Jan Arne Telle Node Multiway Cut and Subset Feedback Vertex Set on Graphs of Bounded Mim-width. Search on Bibsonomy WG The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Alan M. Frieze, Krzysztof Turowski, Wojciech Szpankowski Degree Distribution for Duplication-Divergence Graphs: Large Deviations. Search on Bibsonomy WG The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Oswin Aichholzer, Manuel Borrazzo, Prosenjit Bose, Jean Cardinal, Fabrizio Frati, Pat Morin, Birgit Vogtenhuber Drawing Graphs as Spanners. Search on Bibsonomy WG The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Roman Haag, Hendrik Molter, Rolf Niedermeier, Malte Renken Feedback Edge Sets in Temporal Graphs. Search on Bibsonomy WG The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Martin Milanic, Nevena Pivac Minimal Separators in Graph Classes Defined by Small Forbidden Induced Subgraphs. Search on Bibsonomy WG The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Daniel Gonçalves 0001 3-Colorable Planar Graphs Have an Intersection Segment Representation Using 3 Slopes. Search on Bibsonomy WG The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Rahnuma Islam Nishat, Sue Whitesides Reconfiguring Hamiltonian Cycles in L-Shaped Grid Graphs. Search on Bibsonomy WG The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Karolina Okrasa, Pawel Rzazewski Subexponential Algorithms for Variants of Homomorphism Problem in String Graphs. Search on Bibsonomy WG The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Jan Böker Color Refinement, Homomorphisms, and Hypergraphs. Search on Bibsonomy WG The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Hubie Chen, Radu Curticapean, Holger Dell The Exponential-Time Complexity of Counting (Quantum) Graph Homomorphisms. Search on Bibsonomy WG The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Ignasi Sau, Dimitrios M. Thilikos (eds.) Graph-Theoretic Concepts in Computer Science - 45th International Workshop, WG 2019, Vall de Núria, Spain, June 19-21, 2019, Revised Papers Search on Bibsonomy WG The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Meike Hatzel, Roman Rabinovich 0001, Sebastian Wiederrecht Cyclewidth and the Grid Theorem for Perfect Matching Width of Bipartite Graphs. Search on Bibsonomy WG The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Ivan Bliznets, Danil Sagunov On Happy Colorings, Cuts, and Structural Parameterizations. Search on Bibsonomy WG The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Rémy Belmonte, Tesshu Hanaka, Michael Lampis, Hirotaka Ono 0001, Yota Otachi Independent Set Reconfiguration Parameterized by Modular-Width. Search on Bibsonomy WG The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Patrizio Angelini, Michael A. Bekos, Martin Gronemann, Antonios Symvonis Geometric Representations of Dichotomous Ordinal Data. Search on Bibsonomy WG The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Yann Disser, Andreas Emil Feldmann, Max Klimm, Jochen Könemann Travelling on Graphs with Small Highway Dimension. Search on Bibsonomy WG The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Étienne Bamas, Louis Esperet Local Approximation of the Maximum Cut in Regular Graphs. Search on Bibsonomy WG The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Huib Donkers, Bart M. P. Jansen A Turing Kernelization Dichotomy for Structural Parameterizations of ℱ -Minor-Free Deletion. Search on Bibsonomy WG The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Steven Chaplick Intersection Graphs of Non-crossing Paths. Search on Bibsonomy WG The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Robert Ganian, Sebastian Ordyniak The Power of Cut-Based Parameters for Computing Edge Disjoint Paths. Search on Bibsonomy WG The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Meghana Nasre, Prajakta Nimbhorkar, Nada Pulath Classified Rank-Maximal Matchings and Popular Matchings - Algorithms and Hardness. Search on Bibsonomy WG The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Torben Hagerup Fast Breadth-First Search in Still Less Space. Search on Bibsonomy WG The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Ararat Harutyunyan, Michael Lampis, Vadim V. Lozin, Jérôme Monnot Maximum Independent Sets in Subcubic Graphs: New Results. Search on Bibsonomy WG The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Pierre Bergé, Benjamin Mouscadet, Arpad Rimmel, Joanna Tomasik Fixed-Parameter Tractability of Counting Small Minimum (S, T)-Cuts. Search on Bibsonomy WG The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Dibyayan Chakraborty, Sandip Das 0001, Joydeep Mukherjee Approximating Minimum Dominating Set on String Graphs. Search on Bibsonomy WG The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Nicolas Bousquet, Tatsuhiko Hatanaka, Takehiro Ito, Moritz Mühlenthaler Shortest Reconfiguration of Matchings. Search on Bibsonomy WG The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Oswin Aichholzer, Jean Cardinal, Tony Huynh, Kolja Knauer, Torsten Mütze, Raphael Steiner, Birgit Vogtenhuber Flip Distances Between Graph Orientations. Search on Bibsonomy WG The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Svein Høgemo, Jan Arne Telle, Erlend Raa Vågset Linear MIM-Width of Trees. Search on Bibsonomy WG The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Therese Biedl, Ahmad Biniaz, Veronika Irvine, Kshitij Jain 0001, Philipp Kindermann, Anna Lubiw Maximum Matchings and Minimum Blocking Sets in \varTheta _6 -Graphs. Search on Bibsonomy WG The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Martin E. Dyer, Catherine S. Greenhill, Haiko Müller Counting Independent Sets in Graphs with Bounded Bipartite Pathwidth. Search on Bibsonomy WG The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Edin Husic, Martin Milanic A Polynomial-Time Algorithm for the Independent Set Problem in P_10, C_4, C_6 -Free Graphs. Search on Bibsonomy WG The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Bogdan Alecu, Aistis Atminas, Vadim V. Lozin Graph Functionality. Search on Bibsonomy WG The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Guillaume Ducoffe The 4-Steiner Root Problem. Search on Bibsonomy WG The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Bart M. P. Jansen, László Kozma 0002, Jesper Nederlof Hamiltonicity Below Dirac's Condition. Search on Bibsonomy WG The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Anna Lubiw, Debajyoti Mondal Construction and Local Routing for Angle-Monotone Graphs. Search on Bibsonomy WG The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Paz Carmi, Vida Dujmovic, Pat Morin Anagram-Free Chromatic Number Is Not Pathwidth-Bounded. Search on Bibsonomy WG The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Michael A. Bekos, Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani, Chrysanthi N. Raftopoulou Edge Partitions of Optimal 2-plane and 3-plane Graphs. Search on Bibsonomy WG The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1B. S. Panda 0001, Anita Das 0001 Characterization and Recognition of Tree 3-Spanner Admissible Directed Path Graphs of Diameter Three. Search on Bibsonomy WG The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Alessio Conte, Roberto Grossi, Andrea Marino 0001, Romeo Rizzi, Takeaki Uno, Luca Versari Tight Lower Bounds for the Number of Inclusion-Minimal st-Cuts. Search on Bibsonomy WG The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Peter Damaschke Saving Probe Bits by Cube Domination. Search on Bibsonomy WG The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Jeremy Kun, Michael P. O'Brien, Blair D. Sullivan Treedepth Bounds in Linear Colorings. Search on Bibsonomy WG The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Niels Grüttemeier, Christian Komusiewicz On the Relation of Strong Triadic Closure and Cluster Deletion. Search on Bibsonomy WG The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Stefan Felsner, Hendrik Schrezenmaier, Raphael Steiner Equiangular Polygon Contact Representations. Search on Bibsonomy WG The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Marthe Bonamy, Lukasz Kowalik, Jesper Nederlof, Michal Pilipczuk, Arkadiusz Socala, Marcin Wrochna On Directed Feedback Vertex Set Parameterized by Treewidth. Search on Bibsonomy WG The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Till Fluschnik, Hendrik Molter, Rolf Niedermeier, Philipp Zschoche Temporal Graph Classes: A View Through Temporal Separators. Search on Bibsonomy WG The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Martin E. Dyer, Haiko Müller Quasimonotone Graphs. Search on Bibsonomy WG The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Jelco M. Bodewes, Hans L. Bodlaender, Gunther Cornelissen, Marieke van der Wegen Recognizing Hyperelliptic Graphs in Polynomial Time. Search on Bibsonomy WG The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Thomas Bellitto, Benjamin Bergougnoux On Minimum Connecting Transition Sets in Graphs. Search on Bibsonomy WG The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Linda Kleist, Boris Klemz, Anna Lubiw, Lena Schlipf, Frank Staals, Darren Strash Convexity-Increasing Morphs of Planar Graphs. Search on Bibsonomy WG The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Telikepalli Kavitha Popular Matchings of Desired Size. Search on Bibsonomy WG The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Mateus de Oliveira Oliveira Graph Amalgamation Under Logical Constraints. Search on Bibsonomy WG The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Andreas Brandstädt, Ekkehard Köhler, Klaus Meer (eds.) Graph-Theoretic Concepts in Computer Science - 44th International Workshop, WG 2018, Cottbus, Germany, June 27-29, 2018, Proceedings Search on Bibsonomy WG The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Édouard Bonnet, Pawel Rzazewski Optimality Program in Segment and String Graphs. Search on Bibsonomy WG The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Shaohua Li 0005, Marcin Pilipczuk An Improved FPT Algorithm for Independent Feedback Vertex Set. Search on Bibsonomy WG The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Giordano Da Lozzo, David Eppstein, Michael T. Goodrich, Siddharth Gupta 0002 Subexponential-Time and FPT Algorithms for Embedded Flat Clustered Planarity. Search on Bibsonomy WG The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Jawaherul Md. Alam, Michael A. Bekos, Martin Gronemann, Michael Kaufmann 0001, Sergey Pupyrev On Dispersable Book Embeddings. Search on Bibsonomy WG The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Matthew Johnson 0002, Giacomo Paesani, Daniël Paulusma Connected Vertex Cover for (sP_1+P_5) ( s P 1 + P 5 ) -Free Graphs. Search on Bibsonomy WG The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Michael Gene Dobbins, Linda Kleist, Tillmann Miltzow, Pawel Rzazewski ∀∃ℝ-Completeness and Area-Universality. Search on Bibsonomy WG The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Lars Jaffke, Mateus de Oliveira Oliveira On Weak Isomorphism of Rooted Vertex-Colored Graphs. Search on Bibsonomy WG The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Szymon Dudycz, Katarzyna Paluch 0001 Optimal General Matchings. Search on Bibsonomy WG The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Konrad K. Dabrowski, François Dross, Jisu Jeong, Mamadou Moustapha Kanté, O-joung Kwon, Sang-il Oum, Daniël Paulusma Computing Small Pivot-Minors. Search on Bibsonomy WG The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Ioannis Katsikarelis, Michael Lampis, Vangelis Th. Paschos Structurally Parameterized d-Scattered Set. Search on Bibsonomy WG The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Renzo Gómez, Yoshiko Wakabayashi Covering a Graph with Nontrivial Vertex-Disjoint Paths: Existence and Optimization. Search on Bibsonomy WG The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Jesse Beisegel Characterising AT-free Graphs with BFS. Search on Bibsonomy WG The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Meike Hatzel, Sebastian Wiederrecht On Perfect Linegraph Squares. Search on Bibsonomy WG The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Maria Chudnovsky, Oliver Schaudt, Sophie Spirkl, Maya Stein, Mingxian Zhong Approximately Coloring Graphs Without Long Induced Paths. Search on Bibsonomy WG The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Dusan Knop, Martin Koutecký, Tomás Masarík, Tomás Toufar Simplified Algorithmic Metatheorems Beyond MSO: Treewidth and Neighborhood Diversity. Search on Bibsonomy WG The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Till Fluschnik, Meike Hatzel, Steffen Härtlein, Hendrik Molter, Henning Seidler The Minimum Shared Edges Problem on Grid-Like Graphs. Search on Bibsonomy WG The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Tomasz Krawczyk, Bartosz Walczak Extending Partial Representations of Trapezoid Graphs. Search on Bibsonomy WG The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Jean Cardinal, Stefan Felsner, Tillmann Miltzow, Casey Tompkins, Birgit Vogtenhuber Intersection Graphs of Rays and Grounded Segments. Search on Bibsonomy WG The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Ademir Hujdurovic, Edin Husic, Martin Milanic, Romeo Rizzi, Alexandru I. Tomescu The Minimum Conflict-Free Row Split Problem Revisited. Search on Bibsonomy WG The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Patrizio Angelini, Michael A. Bekos, Franz J. Brandenburg, Giordano Da Lozzo, Giuseppe Di Battista, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani, Ignaz Rutter On the Relationship Between k-Planar and k-Quasi-Planar Graphs. Search on Bibsonomy WG The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1O-joung Kwon, Michal Pilipczuk, Sebastian Siebertz On Low Rank-Width Colorings. Search on Bibsonomy WG The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
Displaying result #101 - #200 of 1343 (100 per page; Change: )
Pages: [<<][1][2][3][4][5][6][7][8][9][10][11][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by L3S.
Previously maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license