The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for WG with no syntactic query expansion in all metadata.

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 (33) 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(1295) proceedings(49)
Venues (Conferences, Journals, ...)
WG(1343) FSE(1)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 288 occurrences of 178 keywords

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