default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID47th WG 2021: Warsaw, Poland
- Lukasz Kowalik
, Michal Pilipczuk, Pawel Rzazewski:
Graph-Theoretic Concepts in Computer Science - 47th International Workshop, WG 2021, Warsaw, Poland, June 23-25, 2021, Revised Selected Papers. Lecture Notes in Computer Science 12911, Springer 2021, ISBN 978-3-030-86837-6 - Huib Donkers, Bart M. P. Jansen:
Preprocessing to Reduce the Search Space: Antler Structures for Feedback Vertex Set. 1-14 - Hans L. Bodlaender:
Parameterized Complexity of Bandwidth of Caterpillars and Weighted Path Emulation. 15-27 - Öznur Yasar Diner, Archontia C. Giannopoulou, Giannos Stamoulis, Dimitrios M. Thilikos:
Block Elimination Distance. 28-38 - Sayan Bandyapadhyay, Aritra Banik, Sujoy Bhore:
On Fair Covering and Hitting Problems. 39-51 - Isja Mannens, Jesper Nederlof, Céline M. F. Swennenhuis, Krisztina Szilágyi:
On the Parameterized Complexity of the Connected Flow and Many Visits TSP Problem. 52-79 - Bart M. P. Jansen, Jari J. H. de Kroon:
FPT Algorithms to Compute the Elimination Distance to Bipartite Graphs and More. 80-93 - Aadityan Ganesh, Vishwa Prakash HV, Prajakta Nimbhorkar, Geevarghese Philip:
Disjoint Stable Matchings in Linear Time. 94-105 - Yixin Cao, Shenghua Wang:
Complementation in T-perfect Graphs. 106-117 - Dhanyamol Antony, Jay Garchar, Sagartanu Pal, R. B. Sandeep, Sagnik Sen, R. Subashini:
On Subgraph Complementation to H-free Graphs. 118-129 - Avinandan Das, Lawqueen Kanesh, Jayakrishnan Madathil, Saket Saurabh:
Odd Cycle Transversal in Mixed Graphs. 130-142 - Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz, Frank Sommer:
Preventing Small (s,t)Cuts by Protecting Edges. 143-155 - Christophe Crespelle, Benjamin Gras, Anthony Perez:
Completion to Chordal Distance-Hereditary Graphs: A Quartic Vertex-Kernel. 156-168 - Sylwester Swat, Marta Kasprzak:
A Heuristic Approach to the Treedepth Decomposition Problem for Large Graphs. 169-181 - Van Bang Le, Jan Arne Telle:
The Perfect Matching Cut Problem Revisited. 182-194 - Matthias Bentert, Tomohiro Koana, Rolf Niedermeier:
The Complexity of Gerrymandering over Graphs: Paths and Trees. 195-206 - Dario Cavallaro, Till Fluschnik:
Feedback Vertex Set on Hamiltonian Graphs. 207-218 - Maciej Rymar, Hendrik Molter, André Nichterlein, Rolf Niedermeier:
Towards Classifying the Polynomial-Time Solvability of Temporal Betweenness Centrality. 219-231 - Nils Vortmeier, Ioannis Kokkinis:
The Dynamic Complexity of Acyclic Hypergraph Homomorphisms. 232-244 - Eranda Çela, Bettina Klinz, Stefan Lendl, James B. Orlin, Gerhard J. Woeginger, Lasse Wulf:
Linearizable Special Cases of the Quadratic Shortest Path Problem. 245-256 - Manuel Cáceres, Massimo Cairo, Brendan Mumey, Romeo Rizzi, Alexandru I. Tomescu:
A Linear-Time Parameterized Algorithm for Computing the Width of a DAG. 257-269 - Patrizio Angelini, Michael A. Bekos, Fabrizio Montecchiani, Maximilian Pfister:
On Morphing 1-Planar Drawings. 270-282 - Václav Blazej, Pavel Dvorák, Michal Opler:
Bears with Hats and Independence Polynomials. 283-295 - Julien Bensmail, Foivos Fioravantes, Fionn Mc Inerney, Nicolas Nisse:
The Largest Connected Subgraph Game. 296-307 - Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos:
Can Romeo and Juliet Meet? or Rendezvous Games with Adversaries on Graphs. 308-320 - Guillaume Ducoffe:
Beyond Helly Graphs: The Diameter Problem on Absolute Retracts. 321-335 - Christoph Brause, Petr A. Golovach, Barnaby Martin, Daniël Paulusma, Siani Smith:
Acyclic, Star, and Injective Colouring: Bounding the Diameter. 336-348 - David Eppstein:
The Graphs of Stably Matchable Pairs. 349-360 - Abu Reyan Ahmed, Greg Bodwin, Keaton Hamm, Stephen G. Kobourov, Richard Spence:
On Additive Spanners in Weighted Graphs with Local Error. 361-373 - Colin Krisko, Avery Miller:
Labeling Schemes for Deterministic Radio Multi-broadcast. 374-387 - Vít Jelínek, Tereza Klimosová, Tomás Masarík, Jana Novotná, Aneta Pokorná:
On 3-Coloring of (2P4, C5)-Free Graphs. 388-401
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-05-09 19:37 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:
