default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID49th WG 2023: Fribourg, Switzerland
- Daniël Paulusma
, Bernard Ries:
Graph-Theoretic Concepts in Computer Science - 49th International Workshop, WG 2023, Fribourg, Switzerland, June 28-30, 2023, Revised Selected Papers. Lecture Notes in Computer Science 14093, Springer 2023, ISBN 978-3-031-43379-5 - Sayan Bandyapadhyay, Fedor V. Fomin, Tanmay Inamdar, Kirill Simonov:
Proportionally Fair Matching with Multiple Groups. 1-15 - Paul Bastide, Linda Cook, Jeff Erickson, Carla Groenland, Marc J. van Kreveld, Isja Mannens, Jordi L. Vermeulen:
Reconstructing Graphs from Connected Triples. 16-29 - Jakob Baumann, Matthias Pfretzschner, Ignaz Rutter:
Parameterized Complexity of Vertex Splitting to Pathwidth at Most 1. 30-43 - Rémy Belmonte, Ararat Harutyunyan, Noleen Köhler, Nikolaos Melissinos:
Odd Chromatic Number of Graph Classes. 44-58 - Julien Bensmail, Victor A. Campos, Ana Karolinna Maia, Nicolas Nisse, Ana Silva:
Deciding the Erdős-Pósa Property in 3-Connected Digraphs. 59-71 - Benjamin Bergougnoux, Tuukka Korhonen, Igor Razgon:
New Width Parameters for Independent Set: One-Sided-Mim-Width and Neighbor-Depth. 72-85 - Carla Binucci, Giuseppe Di Battista, Walter Didimo, Seok-Hee Hong, Michael Kaufmann, Giuseppe Liotta, Pat Morin, Alessandra Tappini:
Nonplanar Graph Drawings with k Vertices per Face. 86-100 - Jan Bok, Jirí Fiala, Nikola Jedlicková, Jan Kratochvíl, Michaela Seifrtová:
Computational Complexity of Covering Colored Mixed Multigraphs with Degree Partition Equivalence Classes of Size at Most Two (Extended Abstract). 101-115 - Édouard Bonnet, Dibyayan Chakraborty, Julien Duron:
Cutting Barnette Graphs Perfectly is Hard. 116-129 - Nicolas Bousquet, Quentin Deschamps, Aline Parreau:
Metric Dimension Parameterized by Treewidth in Chordal Graphs. 130-142 - Katrin Casel, Tobias Friedrich, Davis Issac, Aikaterini Niklanovits, Ziena Zeif:
Efficient Constructions for the Győri-Lovász Theorem on Almost Chordal Graphs. 143-156 - Radovan Cervený, Ondrej Suchý:
Generating Faster Algorithms for d-Path Vertex Cover. 157-171 - Yeonsu Chang, O-joung Kwon, Myounghwan Lee:
A New Width Parameter of Graphs Based on Edge Cuts: α-Edge-Crossing Width. 172-186 - Steven Chaplick, Steven Kelk, Ruben Meuwese, Matús Mihalák, Georgios Stamoulis:
Snakes and Ladders: A Treewidth Story. 187-200 - Juhi Chaudhary, Meirav Zehavi:
Parameterized Results on Acyclic Matchings with Implications for Related Problems. 201-216 - Juhi Chaudhary, Meirav Zehavi:
P-Matchings Parameterized by Treewidth. 217-231 - Antoine Dailly, Florent Foucaud, Anni Hakanen:
Algorithms and Hardness for Metric Dimension on Digraphs. 232-245 - Tom Davot, Lucas Isenmann, Sanjukta Roy, Jocelyn Thiebaut:
Degreewidth: A New Parameter for Solving Problems on Tournaments. 246-260 - Ilan Doron-Arad, Hadas Shachnai:
Approximating Bin Packing with Conflict Graphs via Maximization Techniques. 261-275 - Feodor F. Dragan, Guillaume Ducoffe:
α i-Metric Graphs: Radius, Diameter and all Eccentricities. 276-290 - Zdenek Dvorák, Abhiruk Lahiri:
Maximum Edge Colouring Problem On Graphs That Exclude a Fixed Minor. 291-304 - Pavel Dvorák, Lukás Folwarczný, Michal Opler, Pavel Pudlák, Robert Sámal, Tung Anh Vu:
Bounds on Functionality and Symmetric Difference - Two Intriguing Graph Parameters. 305-318 - Jessica A. Enright, Kitty Meeks, William Pettersson, John Sylvester:
Cops and Robbers on Multi-Layer Graphs. 319-333 - Fedor V. Fomin, Pierre Fraigniaud, Petr A. Golovach:
Parameterized Complexity of Broadcasting in Graphs. 334-347 - Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov:
Turán's Theorem Through Algorithmic Lens. 348-362 - Jan Goedgebeur, Edita Mácajová, Jarne Renders:
On the Frank Number and Nowhere-Zero Flows on Graphs. 363-375 - Frédéric Havet, Lucas Picasarri-Arrieta, Clément Rambaud:
On the Minimum Number of Arcs in 4-Dicritical Oriented Graphs. 376-387 - Falko Hegerfeld, Stefan Kratsch:
Tight Algorithms for Connectivity Problems Parameterized by Modular-Treewidth. 388-402 - Paul Jungeblut, Samuel Schneider, Torsten Ueckerdt:
Cops and Robber - When Capturing Is Not Surrounding. 403-416 - Hoàng-Oanh Le, Van Bang Le:
Complexity Results for Matching Cut Problems in Graphs Without Long Induced Paths. 417-431 - Martin Milanic, Yushi Uno:
Upper Clique Transversals in Graphs. 432-446 - Meghana Nasre, Prajakta Nimbhorkar, Keshav Ranjan:
Critical Relaxed Stable Matchings with Two-Sided Ties. 447-461 - Robert Scheffler:
Graph Search Trees and Their Leaves. 462-476
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 2024-10-31 20:01 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:
