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