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-1983 (34) 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)
Publication types (Num. hits)
inproceedings(1118) proceedings(44)
Venues (Conferences, Journals, ...)
WG(1162)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 283 occurrences of 173 keywords

Results
Found 1162 publication records. Showing 1162 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Lars Jaffke, Mateus de Oliveira Oliveira On Weak Isomorphism of Rooted Vertex-Colored Graphs. Search on Bibsonomy WG The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Marthe Bonamy, Lukasz Kowalik, Jesper Nederlof, Michal Pilipczuk, Arkadiusz Socala, Marcin Wrochna On Directed Feedback Vertex Set Parameterized by Treewidth. Search on Bibsonomy WG The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Martin E. Dyer, Haiko Müller Quasimonotone Graphs. Search on Bibsonomy WG The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Alessio Conte, Roberto Grossi, Andrea Marino, Romeo Rizzi, Takeaki Uno, Luca Versari Tight Lower Bounds for the Number of Inclusion-Minimal st-Cuts. Search on Bibsonomy WG The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Jesse Beisegel Characterising AT-free Graphs with BFS. Search on Bibsonomy WG The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1B. S. Panda, Anita Das 0001 Characterization and Recognition of Tree 3-Spanner Admissible Directed Path Graphs of Diameter Three. Search on Bibsonomy WG The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Renzo Gómez, Yoshiko Wakabayashi Covering a Graph with Nontrivial Vertex-Disjoint Paths: Existence and Optimization. Search on Bibsonomy WG The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Michael Gene Dobbins, Linda Kleist, Tillmann Miltzow, Pawel Rzazewski ∀ ∃ \mathbb R ∀ ∃ R -Completeness and Area-Universality. Search on Bibsonomy WG The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Linda Kleist, Boris Klemz, Anna Lubiw, Lena Schlipf, Frank Staals, Darren Strash Convexity-Increasing Morphs of Planar Graphs. Search on Bibsonomy WG The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Stefan Felsner, Hendrik Schrezenmaier, Raphael Steiner Equiangular Polygon Contact Representations. Search on Bibsonomy WG The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Matthew Johnson 0002, Giacomo Paesani, Daniël Paulusma Connected Vertex Cover for (sP_1+P_5) ( s P 1 + P 5 ) -Free Graphs. Search on Bibsonomy WG The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Jelco M. Bodewes, Hans L. Bodlaender, Gunther Cornelissen, Marieke van der Wegen Recognizing Hyperelliptic Graphs in Polynomial Time. Search on Bibsonomy WG The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Anna Lubiw, Debajyoti Mondal Construction and Local Routing for Angle-Monotone Graphs. Search on Bibsonomy WG The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Mateus de Oliveira Oliveira Graph Amalgamation Under Logical Constraints. Search on Bibsonomy WG The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Jeremy Kun, Michael P. O'Brien, Blair D. Sullivan Treedepth Bounds in Linear Colorings. Search on Bibsonomy WG The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Thomas Bellitto, Benjamin Bergougnoux On Minimum Connecting Transition Sets in Graphs. Search on Bibsonomy WG The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Andreas Brandstädt, Ekkehard Köhler, Klaus Meer (eds.) Graph-Theoretic Concepts in Computer Science - 44th International Workshop, WG 2018, Cottbus, Germany, June 27-29, 2018, Proceedings Search on Bibsonomy WG The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Till Fluschnik, Hendrik Molter, Rolf Niedermeier, Philipp Zschoche Temporal Graph Classes: A View Through Temporal Separators. Search on Bibsonomy WG The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Giordano Da Lozzo, David Eppstein, Michael T. Goodrich, Siddharth Gupta 0002 Subexponential-Time and FPT Algorithms for Embedded Flat Clustered Planarity. Search on Bibsonomy WG The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Konrad K. Dabrowski, François Dross, Jisu Jeong, Mamadou Moustapha Kanté, O-joung Kwon, Sang-il Oum, Daniël Paulusma Computing Small Pivot-Minors. Search on Bibsonomy WG The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Jawaherul Md. Alam, Michael A. Bekos, Martin Gronemann, Michael Kaufmann 0001, Sergey Pupyrev On Dispersable Book Embeddings. Search on Bibsonomy WG The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Paz Carmi, Vida Dujmovic, Pat Morin Anagram-Free Chromatic Number Is Not Pathwidth-Bounded. Search on Bibsonomy WG The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Peter Damaschke Saving Probe Bits by Cube Domination. Search on Bibsonomy WG The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Édouard Bonnet, Pawel Rzazewski Optimality Program in Segment and String Graphs. Search on Bibsonomy WG The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Telikepalli Kavitha Popular Matchings of Desired Size. Search on Bibsonomy WG The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Michael A. Bekos, Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani, Chrysanthi N. Raftopoulou Edge Partitions of Optimal 2-plane and 3-plane Graphs. Search on Bibsonomy WG The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Ioannis Katsikarelis, Michael Lampis, Vangelis Th. Paschos Structurally Parameterized d-Scattered Set. Search on Bibsonomy WG The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Niels Grüttemeier, Christian Komusiewicz On the Relation of Strong Triadic Closure and Cluster Deletion. Search on Bibsonomy WG The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Meike Hatzel, Sebastian Wiederrecht On Perfect Linegraph Squares. Search on Bibsonomy WG The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Szymon Dudycz, Katarzyna Paluch Optimal General Matchings. Search on Bibsonomy WG The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Shaohua Li, Marcin Pilipczuk An Improved FPT Algorithm for Independent Feedback Vertex Set. Search on Bibsonomy WG The full citation details ... 2018 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
1Tomasz Krawczyk, Bartosz Walczak Extending Partial Representations of Trapezoid Graphs. Search on Bibsonomy WG The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Patrizio Angelini, Michael A. Bekos, Franz J. Brandenburg, Giordano Da Lozzo, Giuseppe Di Battista, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani, Ignaz Rutter On the Relationship Between k-Planar and k-Quasi-Planar 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
1Dusan Knop, Martin Koutecký, Tomás Masarík, Tomás Toufar Simplified Algorithmic Metatheorems Beyond MSO: Treewidth and Neighborhood Diversity. 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
1Marthe Bonamy, Nicolas Bousquet Token Sliding on Chordal Graphs. 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
1Jean Cardinal, Stefan Felsner, Tillmann Miltzow, Casey Tompkins, Birgit Vogtenhuber Intersection Graphs of Rays and Grounded Segments. 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
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
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
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
1Till Fluschnik, Meike Hatzel, Steffen Härtlein, Hendrik Molter, Henning Seidler The Minimum Shared Edges Problem on Grid-Like Graphs. Search on Bibsonomy WG The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Ademir Hujdurovic, Edin Husic, Martin Milanic, Romeo Rizzi, Alexandru I. Tomescu The Minimum Conflict-Free Row Split Problem Revisited. 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
1O-joung Kwon, Michal Pilipczuk, Sebastian Siebertz On Low Rank-Width Colorings. 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
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
1Manuel Lafond On Strongly Chordal Graphs That Are Not Leaf Powers. 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
1Akanksha Agrawal, 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
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
1Pallavi Jain 0001, M. Jayakrishnan, 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
1Maria Chudnovsky, Oliver Schaudt, Sophie Spirkl, Maya Stein, Mingxian Zhong Approximately Coloring Graphs Without Long Induced Paths. 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
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
1Steven Chaplick, Martin Toepfer 0002, Jan Voborník, Peter Zeman On H-Topological Intersection 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
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
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
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
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
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
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
1Kunal Dutta, Arijit Ghosh On Subgraphs of Bounded Degeneracy in Hypergraphs. 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
1Jan Goedgebeur, Oliver Schaudt Exhaustive Generation of k-Critical ℋ-Free Graphs. Search on Bibsonomy WG The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Mingyu Xiao, Shaowei Kou Almost Induced Matching: Linear Kernels and Parameterized Algorithms. 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
1Jie You, Jianxin Wang, Yixin Cao 0001 Approximate Association via Dissociation. 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
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
1Ondrej Suchý On Directed Steiner Trees with Multiple Roots. Search on Bibsonomy WG The full citation details ... 2016 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
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
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
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
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
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
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
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
1Pedro Montealegre, 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
1M. S. Ramanujan A Faster Parameterized Algorithm for Group Feedback Edge Set. 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
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
1Linda Kleist Drawing Planar Graphs with Prescribed Face Areas. 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
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
1Bernhard Bliem, Stefan Woltran Complexity of Secure Sets. 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
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
1Therese C. Biedl Triangulating Planar Graphs While Keeping the Pathwidth Small. 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
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
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
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
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
Displaying result #1 - #100 of 1162 (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 Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license