Search results for "WG"

Hits ?▲	Authors	Title	Venue	Year	Link
1	Jan Bok, Jirí Fiala 0001, 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).	WG	2023	DBLP DOI BibTeX RDF
1	Katrin Casel, Tobias Friedrich 0001, Davis Issac, Aikaterini Niklanovits, Ziena Zeif	Efficient Constructions for the Győri-Lovász Theorem on Almost Chordal Graphs.	WG	2023	DBLP DOI BibTeX RDF
1	Fedor V. Fomin, Pierre Fraigniaud, Petr A. Golovach	Parameterized Complexity of Broadcasting in Graphs.	WG	2023	DBLP DOI BibTeX RDF
1	Yeonsu Chang, O-joung Kwon, Myounghwan Lee	A New Width Parameter of Graphs Based on Edge Cuts: α-Edge-Crossing Width.	WG	2023	DBLP DOI BibTeX RDF
1	Steven Chaplick, Steven Kelk, Ruben Meuwese, Matús Mihalák, Georgios Stamoulis	Snakes and Ladders: A Treewidth Story.	WG	2023	DBLP DOI BibTeX RDF
1	Hoàng-Oanh Le, Van Bang Le	Complexity Results for Matching Cut Problems in Graphs Without Long Induced Paths.	WG	2023	DBLP DOI BibTeX RDF
1	Benjamin Bergougnoux, Tuukka Korhonen, Igor Razgon	New Width Parameters for Independent Set: One-Sided-Mim-Width and Neighbor-Depth.	WG	2023	DBLP DOI BibTeX RDF
1	Robert Scheffler 0001	Graph Search Trees and Their Leaves.	WG	2023	DBLP DOI BibTeX RDF
1	Paul Bastide 0002, Linda Cook, Jeff Erickson 0001, Carla Groenland, Marc J. van Kreveld, Isja Mannens, Jordi L. Vermeulen	Reconstructing Graphs from Connected Triples.	WG	2023	DBLP DOI BibTeX RDF
1	Juhi Chaudhary, Meirav Zehavi	Parameterized Results on Acyclic Matchings with Implications for Related Problems.	WG	2023	DBLP DOI BibTeX RDF
1	Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov	Turán's Theorem Through Algorithmic Lens.	WG	2023	DBLP DOI BibTeX RDF
1	Sayan Bandyapadhyay, Fedor V. Fomin, Tanmay Inamdar 0002, Kirill Simonov	Proportionally Fair Matching with Multiple Groups.	WG	2023	DBLP DOI BibTeX RDF
1	Paul Jungeblut, Samuel Schneider, Torsten Ueckerdt	Cops and Robber - When Capturing Is Not Surrounding.	WG	2023	DBLP DOI BibTeX RDF
1	Julien Bensmail, Victor A. Campos, Ana Karolinna Maia, Nicolas Nisse, Ana Silva 0001	Deciding the Erdős-Pósa Property in 3-Connected Digraphs.	WG	2023	DBLP DOI BibTeX RDF
1	Tom Davot, Lucas Isenmann, Sanjukta Roy, Jocelyn Thiebaut	Degreewidth: A New Parameter for Solving Problems on Tournaments.	WG	2023	DBLP DOI BibTeX RDF
1	Martin Milanic, Yushi Uno	Upper Clique Transversals in Graphs.	WG	2023	DBLP DOI BibTeX RDF
1	Radovan Cervený, Ondrej Suchý	Generating Faster Algorithms for d-Path Vertex Cover.	WG	2023	DBLP DOI BibTeX RDF
1	Meghana Nasre, Prajakta Nimbhorkar, Keshav Ranjan	Critical Relaxed Stable Matchings with Two-Sided Ties.	WG	2023	DBLP DOI BibTeX RDF
1	Jessica A. Enright, Kitty Meeks, William Pettersson, John Sylvester 0001	Cops and Robbers on Multi-Layer Graphs.	WG	2023	DBLP DOI BibTeX RDF
1	Daniël Paulusma, Bernard Ries (eds.)	Graph-Theoretic Concepts in Computer Science - 49th International Workshop, WG 2023, Fribourg, Switzerland, June 28-30, 2023, Revised Selected Papers	WG	2023	DBLP DOI BibTeX RDF
1	Falko Hegerfeld, Stefan Kratsch	Tight Algorithms for Connectivity Problems Parameterized by Modular-Treewidth.	WG	2023	DBLP DOI BibTeX RDF
1	Juhi Chaudhary, Meirav Zehavi	P-Matchings Parameterized by Treewidth.	WG	2023	DBLP DOI BibTeX RDF
1	Antoine Dailly, Florent Foucaud, Anni Hakanen	Algorithms and Hardness for Metric Dimension on Digraphs.	WG	2023	DBLP DOI BibTeX RDF
1	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.	WG	2023	DBLP DOI BibTeX RDF
1	Feodor F. Dragan, Guillaume Ducoffe	α i-Metric Graphs: Radius, Diameter and all Eccentricities.	WG	2023	DBLP DOI BibTeX RDF
1	Ilan Doron Arad, Hadas Shachnai	Approximating Bin Packing with Conflict Graphs via Maximization Techniques.	WG	2023	DBLP DOI BibTeX RDF
1	Nicolas Bousquet, Quentin Deschamps, Aline Parreau	Metric Dimension Parameterized by Treewidth in Chordal Graphs.	WG	2023	DBLP DOI BibTeX RDF
1	Jakob Baumann, Matthias Pfretzschner, Ignaz Rutter	Parameterized Complexity of Vertex Splitting to Pathwidth at Most 1.	WG	2023	DBLP DOI BibTeX RDF
1	Rémy Belmonte, Ararat Harutyunyan, Noleen Köhler, Nikolaos Melissinos	Odd Chromatic Number of Graph Classes.	WG	2023	DBLP DOI BibTeX RDF
1	Jan Goedgebeur, Edita Mácajová, Jarne Renders	On the Frank Number and Nowhere-Zero Flows on Graphs.	WG	2023	DBLP DOI BibTeX RDF
1	Zdenek Dvorák 0001, Abhiruk Lahiri	Maximum Edge Colouring Problem On Graphs That Exclude a Fixed Minor.	WG	2023	DBLP DOI BibTeX RDF
1	Édouard Bonnet, Dibyayan Chakraborty, Julien Duron	Cutting Barnette Graphs Perfectly is Hard.	WG	2023	DBLP DOI BibTeX RDF
1	Carla Binucci, Giuseppe Di Battista, Walter Didimo, Seok-Hee Hong 0001, Michael Kaufmann 0001, Giuseppe Liotta, Pat Morin, Alessandra Tappini	Nonplanar Graph Drawings with k Vertices per Face.	WG	2023	DBLP DOI BibTeX RDF
1	Frédéric Havet, Lucas Picasarri-Arrieta, Clément Rambaud	On the Minimum Number of Arcs in 4-Dicritical Oriented Graphs.	WG	2023	DBLP DOI BibTeX RDF
1	Andreas Emil Feldmann, Tung Anh Vu	Generalized k-Center: Distinguishing Doubling and Highway Dimension.	WG	2022	DBLP DOI BibTeX RDF
1	Ina Goeßmann, Jonathan Klawitter, Boris Klemz, Felix Klesen, Stephen G. Kobourov, Myroslav Kryven, Alexander Wolff 0001, Johannes Zink 0001	The Segment Number: Algorithms and Universal Lower Bounds for Some Classes of Planar Graphs.	WG	2022	DBLP DOI BibTeX RDF
1	Eduard Eiben, Diptapriyo Majumdar, M. S. Ramanujan 0001	On the Lossy Kernelization for Connected Treedepth Deletion Set.	WG	2022	DBLP DOI BibTeX RDF
1	Vikraman Arvind, Roman Nedela, Ilia Ponomarenko, Peter Zeman 0001	Testing Isomorphism of Chordal Graphs of Bounded Leafage is Fixed-Parameter Tractable (Extended Abstract).	WG	2022	DBLP DOI BibTeX RDF
1	Valentin Bartier, Nicolas Bousquet, Jihad Hanna, Amer E. Mouawad, Sebastian Siebertz	Token Sliding on Graphs of Girth Five.	WG	2022	DBLP DOI BibTeX RDF
1	R. Krithika 0001, Roohani Sharma, Prafullkumar Tale	The Complexity of Contracting Bipartite Graphs into Small Cycles.	WG	2022	DBLP DOI BibTeX RDF
1	Benjamin Bergougnoux, Svein Høgemo, Jan Arne Telle, Martin Vatshelle	Recognition of Linear and Star Variants of Leaf Powers is in P.	WG	2022	DBLP DOI BibTeX RDF
1	Sándor Kisfaludi-Bak, Karolina Okrasa, Pawel Rzazewski	Computing List Homomorphisms in Geometric Intersection Graphs.	WG	2022	DBLP DOI BibTeX RDF
1	Hans L. Bodlaender, Gunther Cornelissen, Marieke van der Wegen	Problems Hard for Treewidth but Easy for Stable Gonality.	WG	2022	DBLP DOI BibTeX RDF
1	Hugo Jacob 0001, Marcin Pilipczuk	Bounding Twin-Width for Bounded-Treewidth Graphs, Planar Graphs, and Bipartite Graphs.	WG	2022	DBLP DOI BibTeX RDF
1	Barnaby Martin, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen	Induced Disjoint Paths and Connected Subgraphs for H-Free Graphs.	WG	2022	DBLP DOI BibTeX RDF
1	Mathew C. Francis, Atrayee Majumder, Rogers Mathew	Bounding Threshold Dimension: Realizing Graphic Boolean Functions as the AND of Majority Gates.	WG	2022	DBLP DOI BibTeX RDF
1	Esther Galby, Dániel Marx, Philipp Schepper, Roohani Sharma, Prafullkumar Tale	Parameterized Complexity of Weighted Multicut in Trees.	WG	2022	DBLP DOI BibTeX RDF
1	Jakub Balabán, Petr Hlinený, Jan Jedelský	Twin-Width and Transductions of Proper k-Mixed-Thin Graphs.	WG	2022	DBLP DOI BibTeX RDF
1	Sergei Kiselev, Andrey Kupavskii, Oleg Verbitsky 0001, Maksim Zhukovskii	On Anti-stochastic Properties of Unlabeled Graphs.	WG	2022	DBLP DOI BibTeX RDF
1	Vera Chekan, Torsten Ueckerdt	Polychromatic Colorings of Unions of Geometric Hypergraphs.	WG	2022	DBLP DOI BibTeX RDF
1	Jirí Fiala 0001, Ignaz Rutter, Peter Stumpf, Peter Zeman 0001	Extending Partial Representations of Circular-Arc Graphs.	WG	2022	DBLP DOI BibTeX RDF
1	Yasuaki Kobayashi, Kazuhiro Kurita, Kunihiro Wasa	Polynomial-Delay and Polynomial-Space Enumeration of Large Maximal Matchings.	WG	2022	DBLP DOI BibTeX RDF
1	Robert Scheffler 0001	Linearizing Partial Search Orders.	WG	2022	DBLP DOI BibTeX RDF
1	Dibyayan Chakraborty, L. Sunil Chandran, Sajith Padinhatteeri, Raji R. Pillai	s-Club Cluster Vertex Deletion on Interval and Well-Partitioned Chordal Graphs.	WG	2022	DBLP DOI BibTeX RDF
1	David Dekker, Bart M. P. Jansen	Kernelization for Feedback Vertex Set via Elimination Distance to a Forest.	WG	2022	DBLP DOI BibTeX RDF
1	Fabian Klute, Marc J. van Kreveld	On Fully Diverse Sets of Geometric Objects and Graphs.	WG	2022	DBLP DOI BibTeX RDF
1	Huib Donkers, Bart M. P. Jansen, Jari J. H. de Kroon	Finding k-Secluded Trees Faster.	WG	2022	DBLP DOI BibTeX RDF
1	Csaba D. Tóth	Minimum Weight Euclidean (1+ε )-Spanners.	WG	2022	DBLP DOI BibTeX RDF
1	Oswin Aichholzer, Julia Obmann, Pavel Paták, Daniel Perz, Josef Tkadlec, Birgit Vogtenhuber	Disjoint Compatibility via Graph Classes.	WG	2022	DBLP DOI BibTeX RDF
1	Giuseppe Liotta, Ignaz Rutter, Alessandra Tappini	Parameterized Complexity of Graph Planarity with Restricted Cyclic Orders.	WG	2022	DBLP DOI BibTeX RDF
1	Faisal N. Abu-Khzam, Henning Fernau, Kevin Mann	Minimal Roman Dominating Functions: Extensions and Enumeration.	WG	2022	DBLP DOI BibTeX RDF
1	Michael A. Bekos, Michael Kaufmann 0001 (eds.)	Graph-Theoretic Concepts in Computer Science - 48th International Workshop, WG 2022, Tübingen, Germany, June 22-24, 2022, Revised Selected Papers	WG	2022	DBLP DOI BibTeX RDF
1	Cornelius Brand, Esra Ceylan, Robert Ganian, Christian Hatschka, Viktoriia Korchemna	Edge-Cut Width: An Algorithmically Driven Analogue of Treewidth Based on Edge Cuts.	WG	2022	DBLP DOI BibTeX RDF
1	Giacomo Paesani, Daniël Paulusma, Pawel Rzazewski	Classifying Subset Feedback Vertex Set for H-Free Graphs.	WG	2022	DBLP DOI BibTeX RDF
1	Laurent Bulteau, Konrad K. Dabrowski, Noleen Köhler, Sebastian Ordyniak, Daniël Paulusma	An Algorithmic Framework for Locally Constrained Homomorphisms.	WG	2022	DBLP DOI BibTeX RDF
1	Gabriel L. Duarte, Uéverton S. Souza	On the Minimum Cycle Cover Problem on Graphs with Bounded Co-degeneracy.	WG	2022	DBLP DOI BibTeX RDF
1	Hélène Langlois, Frédéric Meunier, Romeo Rizzi, Stéphane Vialette	Algorithmic Aspects of Small Quasi-Kernels.	WG	2022	DBLP DOI BibTeX RDF
1	Maciej Rymar, Hendrik Molter, André Nichterlein, Rolf Niedermeier	Towards Classifying the Polynomial-Time Solvability of Temporal Betweenness Centrality.	WG	2021	DBLP DOI BibTeX RDF
1	Sayan Bandyapadhyay, Aritra Banik, Sujoy Bhore	On Fair Covering and Hitting Problems.	WG	2021	DBLP DOI BibTeX RDF
1	Hans L. Bodlaender	Parameterized Complexity of Bandwidth of Caterpillars and Weighted Path Emulation.	WG	2021	DBLP DOI BibTeX RDF
1	Christoph Brause, Petr A. Golovach, Barnaby Martin, Daniël Paulusma, Siani Smith	Acyclic, Star, and Injective Colouring: Bounding the Diameter.	WG	2021	DBLP DOI BibTeX RDF
1	Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos	Can Romeo and Juliet Meet? or Rendezvous Games with Adversaries on Graphs.	WG	2021	DBLP DOI BibTeX RDF
1	Sylwester Swat, Marta Kasprzak	A Heuristic Approach to the Treedepth Decomposition Problem for Large Graphs.	WG	2021	DBLP DOI BibTeX RDF
1	Guillaume Ducoffe	Beyond Helly Graphs: The Diameter Problem on Absolute Retracts.	WG	2021	DBLP DOI BibTeX RDF
1	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.	WG	2021	DBLP DOI BibTeX RDF
1	Vít Jelínek, Tereza Klimosová, Tomás Masarík, Jana Novotná 0001, Aneta Pokorná	On 3-Coloring of (2P4, C5)-Free Graphs.	WG	2021	DBLP DOI BibTeX RDF
1	Huib Donkers, Bart M. P. Jansen	Preprocessing to Reduce the Search Space: Antler Structures for Feedback Vertex Set.	WG	2021	DBLP DOI BibTeX RDF
1	Öznur Yasar Diner, Archontia C. Giannopoulou, Giannos Stamoulis, Dimitrios M. Thilikos	Block Elimination Distance.	WG	2021	DBLP DOI BibTeX RDF
1	Nils Vortmeier, Ioannis Kokkinis	The Dynamic Complexity of Acyclic Hypergraph Homomorphisms.	WG	2021	DBLP DOI BibTeX RDF
1	Aadityan Ganesh, Vishwa Prakash HV, Prajakta Nimbhorkar, Geevarghese Philip	Disjoint Stable Matchings in Linear Time.	WG	2021	DBLP DOI BibTeX RDF
1	Christophe Crespelle, Benjamin Gras 0002, Anthony Perez 0001	Completion to Chordal Distance-Hereditary Graphs: A Quartic Vertex-Kernel.	WG	2021	DBLP DOI BibTeX RDF
1	Manuel Cáceres, Massimo Cairo, Brendan Mumey, Romeo Rizzi, Alexandru I. Tomescu	A Linear-Time Parameterized Algorithm for Computing the Width of a DAG.	WG	2021	DBLP DOI BibTeX RDF
1	Avinandan Das, Lawqueen Kanesh, Jayakrishnan Madathil, Saket Saurabh 0001	Odd Cycle Transversal in Mixed Graphs.	WG	2021	DBLP DOI BibTeX RDF
1	Dhanyamol Antony, Jay Garchar, Sagartanu Pal, R. B. Sandeep, Sagnik Sen 0001, R. Subashini	On Subgraph Complementation to H-free Graphs.	WG	2021	DBLP DOI BibTeX RDF
1	Matthias Bentert, Tomohiro Koana, Rolf Niedermeier	The Complexity of Gerrymandering over Graphs: Paths and Trees.	WG	2021	DBLP DOI BibTeX RDF
1	Van Bang Le, Jan Arne Telle	The Perfect Matching Cut Problem Revisited.	WG	2021	DBLP DOI BibTeX RDF
1	Eranda Çela, Bettina Klinz, Stefan Lendl, James B. Orlin, Gerhard J. Woeginger, Lasse Wulf	Linearizable Special Cases of the Quadratic Shortest Path Problem.	WG	2021	DBLP DOI BibTeX RDF
1	Julien Bensmail, Foivos Fioravantes, Fionn Mc Inerney, Nicolas Nisse	The Largest Connected Subgraph Game.	WG	2021	DBLP DOI BibTeX RDF
1	Lukasz Kowalik, Michal Pilipczuk, Pawel Rzazewski (eds.)	Graph-Theoretic Concepts in Computer Science - 47th International Workshop, WG 2021, Warsaw, Poland, June 23-25, 2021, Revised Selected Papers	WG	2021	DBLP DOI BibTeX RDF
1	Václav Blazej, Pavel Dvorák, Michal Opler	Bears with Hats and Independence Polynomials.	WG	2021	DBLP DOI BibTeX RDF
1	Patrizio Angelini, Michael A. Bekos, Fabrizio Montecchiani, Maximilian Pfister 0002	On Morphing 1-Planar Drawings.	WG	2021	DBLP DOI BibTeX RDF
1	Abu Reyan Ahmed, Greg Bodwin, Keaton Hamm, Stephen G. Kobourov, Richard Spence	On Additive Spanners in Weighted Graphs with Local Error.	WG	2021	DBLP DOI BibTeX RDF
1	Yixin Cao 0001, Shenghua Wang	Complementation in T-perfect Graphs.	WG	2021	DBLP DOI BibTeX RDF
1	Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz, Frank Sommer	Preventing Small (s,t)Cuts by Protecting Edges.	WG	2021	DBLP DOI BibTeX RDF
1	Bart M. P. Jansen, Jari J. H. de Kroon	FPT Algorithms to Compute the Elimination Distance to Bipartite Graphs and More.	WG	2021	DBLP DOI BibTeX RDF
1	David Eppstein	The Graphs of Stably Matchable Pairs.	WG	2021	DBLP DOI BibTeX RDF
1	Colin Krisko, Avery Miller	Labeling Schemes for Deterministic Radio Multi-broadcast.	WG	2021	DBLP DOI BibTeX RDF
1	Dario Cavallaro, Till Fluschnik	Feedback Vertex Set on Hamiltonian Graphs.	WG	2021	DBLP DOI BibTeX RDF
1	Sriram Bhyravarapu, Subrahmanyam Kalyanasundaram	Combinatorial Bounds for Conflict-Free Coloring on Open Neighborhoods.	WG	2020	DBLP DOI BibTeX RDF
1	Onur Çagirici, Petr Hlinený, Filip Pokrývka, Abhisekh Sankaran	Clique-Width of Point Configurations.	WG	2020	DBLP DOI BibTeX RDF