The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications at "WG"( http://dblp.L3S.de/Venues/WG )

URL (DBLP): http://dblp.uni-trier.de/db/conf/wg

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 (32) 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(1294) proceedings(49)
Venues (Conferences, Journals, ...)
WG(1343)
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Ágnes Cseh, Jannik Matuschke New and Simple Algorithms for Stable Flow Problems. Search on Bibsonomy WG The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Paloma T. Lima, Daniël Paulusma Algorithms for Outerplanar Graph Roots and Graph Roots of Pathwidth at Most 2. Search on Bibsonomy WG The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Hans L. Bodlaender, Gerhard J. Woeginger (eds.) Graph-Theoretic Concepts in Computer Science - 43rd International Workshop, WG 2017, Eindhoven, The Netherlands, June 21-23, 2017, Revised Selected Papers Search on Bibsonomy WG The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Gregor Hültenschmidt, Philipp Kindermann, Wouter Meulemans, André Schulz 0001 Drawing Planar Graphs with Few Geometric Primitives. Search on Bibsonomy WG The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Julien Baste, Dieter Rautenbach, Ignasi Sau Uniquely Restricted Matchings and Edge Colorings. Search on Bibsonomy WG The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Manuel Aprile, Yuri Faenza, Samuel Fiorini, Tony Huynh, Marco Macchia Extension Complexity of Stable Set Polytopes of Bipartite Graphs. Search on Bibsonomy WG The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Vadim V. Lozin, Dmitriy S. Malyshev, Raffaele Mosca, Viktor Zamaraev New Results on Weighted Independent Domination. Search on Bibsonomy WG The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Pallavi Jain 0001, Jayakrishnan Madathil, Fahad Panolan, Abhishek Sahu Mixed Dominating Set: A Parameterized Perspective. Search on Bibsonomy WG The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Serge Gaspers, Shenwei Huang Linearly \chi χ -Bounding (P_6, C_4) ( P 6 , C 4 ) -Free Graphs. Search on Bibsonomy WG The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Konrad K. Dabrowski, Vadim V. Lozin, Daniël Paulusma Clique-Width and Well-Quasi-Ordering of Triangle-Free Graph Classes. Search on Bibsonomy WG The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Manuel Lafond On Strongly Chordal Graphs That Are Not Leaf Powers. Search on Bibsonomy WG The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Julien Baste, Marc Noy, Ignasi Sau On the Number of Labeled Graphs of Bounded Treewidth. Search on Bibsonomy WG The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Guillaume Ducoffe Finding Cut-Vertices in the Square Roots of a Graph. Search on Bibsonomy WG The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Akanksha Agrawal 0001, Daniel Lokshtanov, Amer E. Mouawad Critical Node Cut Parameterized by Treewidth and Solution Size is W[1]-Hard. Search on Bibsonomy WG The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Hendrik Schrezenmaier Homothetic Triangle Contact Representations. Search on Bibsonomy WG The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Oliver Schaudt, Fabian Senger The Parameterized Complexity of the Equidomination Problem. Search on Bibsonomy WG The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Rémy Belmonte, Michael Lampis, Valia Mitsou Defective Coloring on Classes of Perfect Graphs. Search on Bibsonomy WG The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Vicente Acuña, Roberto Grossi, Giuseppe F. Italiano, Leandro Lima, Romeo Rizzi, Gustavo Sacomoto, Marie-France Sagot, Blerina Sinaimeri On Bubble Generators in Directed Graphs. Search on Bibsonomy WG The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Remco van der Hofstad Counting Graphs and Null Models of Complex Networks: Configuration Model and Extensions. Search on Bibsonomy WG The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Steven Chaplick, Martin Toepfer 0002, Jan Voborník, Peter Zeman 0001 On H-Topological Intersection Graphs. Search on Bibsonomy WG The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Patrizio Angelini, Michael A. Bekos Hierarchical Partial Planarity. Search on Bibsonomy WG The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Marthe Bonamy, Nicolas Bousquet Token Sliding on Chordal Graphs. Search on Bibsonomy WG The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Nicolas Bousquet, Marc Heinrich Computing Maximum Cliques in B_2 -EPG Graphs. Search on Bibsonomy WG The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Yijia Chen, Martin Grohe, Bingkai Lin The Hardness of Embedding Grids and Walls. Search on Bibsonomy WG The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Petr A. Golovach, Dieter Kratsch, Mathieu Liedloff, Mohamed Yosri Sayadi Enumeration and Maximum Number of Maximal Irredundant Sets for Chordal Graphs. Search on Bibsonomy WG The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Feodor F. Dragan, Ekkehard Köhler, Hend Alrasheed Eccentricity Approximating Trees - Extended Abstract. Search on Bibsonomy WG The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Martin Pergel, Pawel Rzazewski On Edge Intersection Graphs of Paths with 2 Bends. Search on Bibsonomy WG The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Édouard Bonnet, Nick Brettell, O-joung Kwon, Dániel Marx Parameterized Vertex Deletion Problems for Hereditary Graph Classes with a Block Property. Search on Bibsonomy WG The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Jan Goedgebeur, Oliver Schaudt Exhaustive Generation of k-Critical ℋ-Free Graphs. Search on Bibsonomy WG The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Sudeshna Kolay, Ragukumar Pandurangan, Fahad Panolan, Venkatesh Raman 0001, Prafullkumar Tale Harmonious Coloring: Parameterized Algorithms and Upper Bounds. Search on Bibsonomy WG The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Pedro Montealegre 0001, Ioan Todinca On Distance-d Independent Set and Other Problems in Graphs with "few" Minimal Separators. Search on Bibsonomy WG The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Jie You, Jianxin Wang 0001, Yixin Cao 0001 Approximate Association via Dissociation. Search on Bibsonomy WG The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Kunal Dutta, Arijit Ghosh On Subgraphs of Bounded Degeneracy in Hypergraphs. Search on Bibsonomy WG The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Katerina Böhmová, Jérémie Chalopin, Matús Mihalák, Guido Proietti, Peter Widmayer Sequence Hypergraphs. Search on Bibsonomy WG The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Emile Ziedan, Deepak Rajendraprasad, Rogers Mathew, Martin Charles Golumbic, Jérémie Dusart Induced Separation Dimension. Search on Bibsonomy WG The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Archontia C. Giannopoulou, O-joung Kwon, Jean-Florent Raymond, Dimitrios M. Thilikos Packing and Covering Immersion Models of Planar Subcubic Graphs. Search on Bibsonomy WG The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Michal Debski, Zbigniew Lonc, Pawel Rzazewski Sequences of Radius k for Complete Bipartite Graphs. Search on Bibsonomy WG The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Frédéric Maffray, Lucas Pastor The Maximum Weight Stable Set Problem in ( P_6 , bull)-Free Graphs. Search on Bibsonomy WG The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Didem Gözüpek, Sibel Özkan, Christophe Paul, Ignasi Sau, Mordechai Shalom Parameterized Complexity of the MINCCA Problem on Graphs of Bounded Decomposability. Search on Bibsonomy WG The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1M. S. Ramanujan 0001 A Faster Parameterized Algorithm for Group Feedback Edge Set. Search on Bibsonomy WG The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Bruno Escoffier Saving Colors and Max Coloring: Some Fixed-Parameter Tractability Results. Search on Bibsonomy WG The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Fedor V. Fomin, Torstein J. F. Strømme Vertex Cover Structural Parameterization Revisited. Search on Bibsonomy WG The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Ernst W. Mayr (eds.) Graph-Theoretic Concepts in Computer Science - 41st International Workshop, WG 2015, Garching, Germany, June 17-19, 2015, Revised Papers Search on Bibsonomy WG The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Leizhen Cai, Junjie Ye Finding Two Edge-Disjoint Paths with Length Constraints. Search on Bibsonomy WG The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Andreas Brandstädt, Raffaele Mosca Weighted Efficient Domination for P_6 -Free and for P_5 -Free Graphs. Search on Bibsonomy WG The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Mingyu Xiao 0001, Shaowei Kou Almost Induced Matching: Linear Kernels and Parameterized Algorithms. Search on Bibsonomy WG The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Rajesh Chitnis, Lior Kamma, Robert Krauthgamer Tight Bounds for Gomory-Hu-like Cut Counting. Search on Bibsonomy WG The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Eric Angel, Evripidis Bampis, Bruno Escoffier, Michael Lampis Parameterized Power Vertex Cover. Search on Bibsonomy WG The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Linda Kleist Drawing Planar Graphs with Prescribed Face Areas. Search on Bibsonomy WG The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Ondrej Suchý On Directed Steiner Trees with Multiple Roots. Search on Bibsonomy WG The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Mitre Costa Dourado, Lucia Draque Penso, Dieter Rautenbach Geodetic Convexity Parameters for Graphs with Few Short Induced Paths. Search on Bibsonomy WG The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Pinar Heggernes (eds.) Graph-Theoretic Concepts in Computer Science - 42nd International Workshop, WG 2016, Istanbul, Turkey, June 22-24, 2016, Revised Selected Papers Search on Bibsonomy WG The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Ferdinando Cicalese, Balázs Keszegh, Bernard Lidický, Dömötör Pálvölgyi, Tomás Valla On the Tree Search Problem with Non-uniform Costs. Search on Bibsonomy WG The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Guy Kortsarz, Zeev Nutov Approximating Source Location and Star Survivable Network Problems. Search on Bibsonomy WG The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Erik Jan van Leeuwen, Marcin Wrochna Polynomial Kernelization for Removing Induced Claws and Diamonds. Search on Bibsonomy WG The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Thiago Braga Marcilon, Rudini M. Sampaio The Maximum Time of 2-neighbour Bootstrap Percolation in Grid Graphs and Parametrized Results. Search on Bibsonomy WG The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Fernanda Couto, Luérbio Faria, Sylvain Gravier, Sulamita Klein, Vinícius Fernandes dos Santos On the Complexity of Probe and Sandwich Problems for Generalized Threshold Graphs. Search on Bibsonomy WG The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Péter Biró 0001, Walter Kern, Daniël Paulusma, Péter Wojuteczky The Stable Fixtures Problem with Payments. Search on Bibsonomy WG The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Vadim V. Lozin, Igor Razgon, Victor Zamaraev Well-quasi-ordering Does Not Imply Bounded Clique-width. Search on Bibsonomy WG The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Seok-Hee Hong 0001, Hiroshi Nagamochi Testing Full Outer-2-planarity in Linear Time. Search on Bibsonomy WG The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Bernhard Bliem, Stefan Woltran Complexity of Secure Sets. Search on Bibsonomy WG The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Kenjiro Takazawa Decomposition Theorems for Square-free 2-matchings in Bipartite Graphs. Search on Bibsonomy WG The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Péter Hajnal, Alexander Igamberdiev, Günter Rote, André Schulz 0001 Saturated Simple and 2-simple Topological Graphs with Few Edges. Search on Bibsonomy WG The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Carsten Grimm Efficient Farthest-Point Queries in Two-terminal Series-parallel Networks. Search on Bibsonomy WG The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Mamadou Moustapha Kanté, Vincent Limouzy, Arnaud Mary, Lhouari Nourine, Takeaki Uno A Polynomial Delay Algorithm for Enumerating Minimal Dominating Sets in Chordal Graphs. Search on Bibsonomy WG The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Serge Gaspers, Simon Mackenzie On the Number of Minimal Separators in Graphs. Search on Bibsonomy WG The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Balázs Keszegh, Dömötör Pálvölgyi An Abstract Approach to Polychromatic Coloring: Shallow Hitting Sets in ABA-free Hypergraphs and Pseudohalfplanes. Search on Bibsonomy WG The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Martin Grohe, Stephan Kreutzer, Roman Rabinovich 0001, Sebastian Siebertz, Konstantinos S. Stavropoulos Colouring and Covering Nowhere Dense Graphs. Search on Bibsonomy WG The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Mathieu Liedloff, Pedro Montealegre 0001, Ioan Todinca Beyond Classes of Graphs with "Few" Minimal Separators: FPT Results Through Potential Maximal Cliques. Search on Bibsonomy WG The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Eun Jung Kim 0002, Martin Milanic, Oliver Schaudt Recognizing k-equistable Graphs in FPT Time. Search on Bibsonomy WG The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Mamadou Moustapha Kanté, Fatima Zahra Moataz, Benjamin Momège, Nicolas Nisse Finding Paths in Grids with Forbidden Transitions. Search on Bibsonomy WG The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Md. Jawaherul Alam, Stephen G. Kobourov, Sergey Pupyrev, Jackson Toeniskoetter Weak Unit Disk and Interval Representation of Graphs. Search on Bibsonomy WG The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Therese Biedl Triangulating Planar Graphs While Keeping the Pathwidth Small. Search on Bibsonomy WG The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Rémy Belmonte, Yota Otachi, Pascal Schweitzer Induced Minor Free Graphs: Isomorphism and Clique-width. Search on Bibsonomy WG The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Feodor F. Dragan, Arne Leitert Minimum Eccentricity Shortest Paths in Some Structured Graph Classes. Search on Bibsonomy WG The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Felix Joos Parity Linkage and the Erdős-Pósa Property of Odd Cycles Through Prescribed Vertices in Highly Connected Graphs. Search on Bibsonomy WG The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Shmuel Zaks On the Complexity of Approximation and Online Scheduling Problems with Applications to Optical Networks. Search on Bibsonomy WG The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Florent Foucaud, George B. Mertzios, Reza Naserasr, Aline Parreau, Petru Valicov Algorithms and Complexity for Metric Dimension and Location-domination on Interval and Permutation Graphs. Search on Bibsonomy WG The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Mateus de Oliveira Oliveira A Slice Theoretic Approach for Embedding Problems on Digraphs. Search on Bibsonomy WG The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Andreas Brandstädt, Elaine M. Eschen, Erik Friese Efficient Domination for Some Subclasses of P_6 -free Graphs in Polynomial Time. Search on Bibsonomy WG The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Christian Komusiewicz, André Nichterlein, Rolf Niedermeier Parameterized Algorithmics for Graph Modification Problems: On Interactions with Heuristics. Search on Bibsonomy WG The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Christophe Crespelle, Anthony Perez 0001, Ioan Todinca An O(n^2) Time Algorithm for the Minimal Permutation Completion Problem. Search on Bibsonomy WG The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1William S. Evans, Giuseppe Liotta, Fabrizio Montecchiani Simultaneous Visibility Representations of Plane st-graphs Using L-shapes. Search on Bibsonomy WG The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Bart M. P. Jansen On Structural Parameterizations of Hitting Set: Hitting Paths in Graphs Using 2-SAT. Search on Bibsonomy WG The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Luis Pedro Montejano 0001, Ignasi Sau On the Complexity of Computing the k-restricted Edge-connectivity of a Graph. Search on Bibsonomy WG The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Daniël Paulusma Open Problems on Graph Coloring for Special Graph Classes. Search on Bibsonomy WG The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1János Pach, Dömötör Pálvölgyi Unsplittable Coverings in the Plane. Search on Bibsonomy WG The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Stefan Hougardy, Rasmus T. Schroeder Edge Elimination in TSP Instances. Search on Bibsonomy WG The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Paul S. Bonsma Independent Set Reconfiguration in Cographs. Search on Bibsonomy WG The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Kustaa Kangas, Petteri Kaski, Mikko Koivisto, Janne H. Korhonen On the Number of Connected Sets in Bounded Degree Graphs. Search on Bibsonomy WG The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Nieke Aerts, Stefan Felsner Vertex Contact Graphs of Paths on a Grid. Search on Bibsonomy WG The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Basile Couëtoux, Elie Nakache, Yann Vaxès The Maximum Labeled Path Problem. Search on Bibsonomy WG The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Rajiv Gandhi, Guy Kortsarz On Set Expansion Problems and the Small Set Expansion Conjecture. Search on Bibsonomy WG The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Felix Joos A Characterization of Mixed Unit Interval Graphs. Search on Bibsonomy WG The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Petr A. Golovach, Pinar Heggernes, Nathan Lindzey, Ross M. McConnell, Vinícius Fernandes dos Santos, Jeremy P. Spinrad Recognizing Threshold Tolerance Graphs in O(n2) Time. Search on Bibsonomy WG The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Leo van Iersel, Steven Kelk Kernelizations for the Hybridization Number Problem on Multiple Nonbinary Trees. Search on Bibsonomy WG The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Manu Basavaraju, Pinar Heggernes, Pim van 't Hof, Reza Saei, Yngve Villanger Maximal Induced Matchings in Triangle-Free Graphs. Search on Bibsonomy WG The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Manu Basavaraju, L. Sunil Chandran, Martin Charles Golumbic, Rogers Mathew, Deepak Rajendraprasad Boxicity and Separation Dimension. Search on Bibsonomy WG The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Michael Lampis, Kazuhisa Makino, Valia Mitsou, Yushi Uno Parameterized Edge Hamiltonicity. Search on Bibsonomy WG The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Qian-Ping Gu, Gengchun Xu Near-Linear Time Constant-Factor Approximation Algorithm for Branch-Decomposition of Planar Graphs. Search on Bibsonomy WG The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
Displaying result #201 - #300 of 1343 (100 per page; Change: )
Pages: [<<][1][2][3][4][5][6][7][8][9][10][11][12][>>]
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