Search    Browse

The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Andreas Brandstädt" ( http://dblp.L3S.de/Authors/Andreas_Brandstädt )

URL (Homepage):  http://wwwteo.informatik.uni-rostock.de/~ab/ab.html  Author page on DBLP  Author page in RDF  Community of Andreas Brandstädt in ASPL-2

Publication years (Num. hits)
1977-1991 (16) 1992-1997 (17) 1998-2000 (16) 2001-2003 (16) 2004-2005 (15) 2006-2008 (19) 2009-2011 (18) 2012 (2)
Publication types (Num. hits)
article(81) book(1) inproceedings(34) proceedings(3)
Venues (Conferences, Journals, ...)
Discrete Applied Mathematics(22) WG(13) Theor. Comput. Sci.(12) Discrete Mathematics(10) FCT(7) Inf. Process. Lett.(6) SIAM J. Discrete Math.(5) Elektronische Informationsvera...(4) Algorithmica(3) ISAAC(3) COCOA(2) CoRR(2) Discrete Mathematics & Theoret...(2) Exact, Approximative, Robust a...(2) Graph Theory, Computational In...(2) Graphs and Combinatorics(2) More (+10 of total 33)
Authors
Andreas Brandstädt(119) Van Bang Le(31) Feodor F. Dragan(27) Raffaele Mosca(13) Hoàng-Oanh Le(12) Dieter Kratsch(9) Vadim V. Lozin(8) Victor Chepoi(8) Chính T. Hoàng(5) Falk Nicolai(5) Peter Wagner 0002(5) Jeremy Spinrad(4) Suhail Mahfud(4) Christian Hundt(3) Dieter Rautenbach(3) Martin Charles Golumbic(3) More (+10 of total 50)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 24 occurrences of 16 keywords
Results
Found 119 publication records. Showing 119 according to the selection in the facets
Hits ?▲ Authors Title Venue Year Link Author keywords
1Andreas Brandstädt, Vassilis Giakoumakis Maximum Weight Independent Sets in hole- and co-chair-free graphs. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Andreas Brandstädt, Vassilis Giakoumakis, Frédéric Maffray Clique separator decomposition of hole-free and diamond-free graphs and algorithmic consequences. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Andreas Brandstädt, Martin Charles Golumbic, Van Bang Le, Marina Lipshteyn Path-Bicolorable Graphs. Search on Bibsonomy Graphs and Combinatorics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Andreas Brandstädt, Raffaele Mosca Dominating Induced Matchings for P7-Free Graphs in Linear Time Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
1Andreas Brandstädt, Vassilis Giakoumakis Clique Separator Decomposition of Hole- and Diamond-Free Graphs and Algorithmic Consequences Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
1Andreas Brandstädt, Raffaele Mosca On distance-3 matchings and induced matchings. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Andreas Brandstädt, Martin Charles Golumbic, Pinar Heggernes, Ross M. McConnell Exploiting graph structure to cope with hard problems (Dagstuhl Seminar 11182). Search on Bibsonomy Dagstuhl Reports The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Andreas Brandstädt, Raffaele Mosca Dominating Induced Matchings for P 7-free Graphs in Linear Time. Search on Bibsonomy ISAAC The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Andreas Brandstädt, Van Bang Le, Dieter Rautenbach Exact leaf powers. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Andreas Brandstädt, Christian Hundt, Federico Mancini, Peter Wagner 0002 Rooted directed path graphs are leaf powers. Search on Bibsonomy Discrete Mathematics The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Andreas Brandstädt, Tilo Klembt, Vadim V. Lozin, Raffaele Mosca On Independent Vertex Sets in Subclasses of Apple-Free Graphs. Search on Bibsonomy Algorithmica The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Andreas Brandstädt, Vadim V. Lozin, Raffaele Mosca Independent Sets of Maximum Weight in Apple-Free Graphs. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Andreas Brandstädt, Peter Wagner 0002 Characterising (k, l)-leaf powers. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Andreas Brandstädt, Christian Hundt, Ragnar Nevries Efficient Edge Domination on Hole-Free Graphs in Polynomial Time. Search on Bibsonomy LATIN The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Andreas Brandstädt, Van Bang Le Simplicial powers of graphs. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Peter Wagner 0002, Andreas Brandstädt The complete inclusion structure of leaf power classes. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Andreas Brandstädt, Van Bang Le, Dieter Rautenbach A forbidden induced subgraph characterization of distance-hereditary 5-leaf powers. Search on Bibsonomy Discrete Mathematics The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Andreas Brandstädt, Konrad Engel, Hans-Dietrich O. F. Gronau, Van Bang Le Preface. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Andreas Brandstädt, Raffaele Mosca On Distance-3 Matchings and Induced Matchings. Search on Bibsonomy Graph Theory, Computational Intelligence and Thought The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Distance-k matching, Maximum Distance-k Matching Problem, Maximum Induced Matching Problem, chordal graphs
1Andreas Brandstädt, Martin Charles Golumbic, Van Bang Le, Marina Lipshteyn Path-Bicolorable Graphs. Search on Bibsonomy Graph Theory, Computational Intelligence and Thought The full citation details ... 2009 DBLP  DOI  BibTeX  RDF P 3-bicolorable graphs, P 4-bicolorable graphs, linear time recognition, bipartite graphs
1Andreas Brandstädt, Chính T. Hoàng Maximum Induced Matchings for Chordal Graphs in Linear Time. Search on Bibsonomy Algorithmica The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Maximum induced matchings, Perfect elimination order, Lexicographic breadth-first search, Chordal graphs, Linear time algorithm
1Andreas Brandstädt, Van Bang Le, R. Sritharan Structure and linear-time recognition of 4-leaf powers. Search on Bibsonomy ACM Transactions on Algorithms The full citation details ... 2008 DBLP  DOI  BibTeX  RDF squares of trees, trees, phylogenetic trees, leaf powers, Graph powers
1Andreas Brandstädt, Christian Hundt Ptolemaic Graphs and Interval Graphs Are Leaf Powers. Search on Bibsonomy LATIN The full citation details ... 2008 DBLP  DOI  BibTeX  RDF and Classification Leaf powers, leaf roots, strongly chordal graphs, ptolemaic graphs, graph class inclusions, (unit) interval graphs, clique-width, graph powers
1Andreas Brandstädt, Peter Wagner 0002 On k-Versus (k+1)-Leaf Powers. Search on Bibsonomy COCOA The full citation details ... 2008 DBLP  DOI  BibTeX  RDF k-leaf powers, intersection of leaf power classes, comparability of leaf power classes
1Andreas Brandstädt, Van Bang Le Simplicial Powers of Graphs. Search on Bibsonomy COCOA The full citation details ... 2008 DBLP  DOI  BibTeX  RDF simplicial powers, forbidden induced subgraph characterization, block graphs, ptolemaic graphs, strongly chordal graphs, chordal graphs, leaf powers, Graph powers
1Andreas Brandstädt, Tilo Klembt, Vadim V. Lozin, Raffaele Mosca Independent Sets of Maximum Weight in Apple-Free Graphs. Search on Bibsonomy ISAAC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF clique separators, apple-free graphs, polynomial-time algorithm, Maximum independent set, modular decomposition, claw-free graphs
1Andreas Brandstädt, Van Bang Le, Suhail Mahfud New applications of clique separator decomposition for the Maximum Weight Stable Set problem. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Andreas Brandstädt, Elaine M. Eschen, R. Sritharan The induced matching and chain subgraph cover problems for convex bipartite graphs. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Andreas Brandstädt, Chính T. Hoàng On clique separators, nearly chordal graphs, and the Maximum Weight Stable Set Problem. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Van Bang Le, Ryuhei Uehara Tree Spanners for Bipartite Graphs and Probe Interval Graphs. Search on Bibsonomy Algorithmica The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Andreas Brandstädt, Dieter Kratsch, Haiko Müller (eds.) Graph-Theoretic Concepts in Computer Science, 33rd International Workshop, WG 2007, Dornburg, Germany, June 21-23, 2007. Revised Papers Search on Bibsonomy WG The full citation details ... 2007 DBLP  BibTeX  RDF
1Andreas Brandstädt, Peter Wagner 0002 On ( k , l)-Leaf Powers. Search on Bibsonomy MFCS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF (k and ?) -leaf powers, leaf roots, strictly chordal graphs, linear time algorithms, leaf powers
1Andreas Brandstädt, Klaus Jansen, Dieter Kratsch, Jeremy Spinrad 07211 Abstracts Collection - Exact, Approximative, Robust and Certifying Algorithms on Particular Graph Classes. Search on Bibsonomy Exact, Approximative, Robust and Certifying Algorithms on Particular Graph Classes The full citation details ... 2007 DBLP  BibTeX  RDF
1Andreas Brandstädt, Klaus Jansen, Dieter Kratsch, Jeremy Spinrad (eds.) Exact, Approximative, Robust and Certifying Algorithms on Particular Graph Classes, 20.05. - 25.05.2007 Search on Bibsonomy Exact, Approximative, Robust and Certifying Algorithms on Particular Graph Classes The full citation details ... 2007 DBLP  BibTeX  RDF
1Dieter Rautenbach, Andreas Brandstädt, Van Bang Le Distance-Hereditary 5-Leaf Powers. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Andreas Brandstädt, Van Bang Le Structure and linear time recognition of 3-leaf powers. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Andreas Brandstädt, Tilo Klembt, Suhail Mahfud P6- and triangle-free graphs revisited: structure and bounded clique-width. Search on Bibsonomy Discrete Mathematics & Theoretical Computer Science The full citation details ... 2006 DBLP  BibTeX  RDF
1Andreas Brandstädt, Joost Engelfriet, Hoàng-Oanh Le, Vadim V. Lozin Clique-Width for 4-Vertex Forbidden Subgraphs. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Andreas Brandstädt, Feodor F. Dragan, Yang Xiang, Chenyu Yan Generalized Powers of Graphs and Their Algorithmic Use. Search on Bibsonomy SWAT The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Hans L. Bodlaender, Andreas Brandstädt, Dieter Kratsch, Michaël Rao, Jeremy Spinrad On algorithms for (P5, gem)-free graphs. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Andreas Brandstädt, Peter L. Hammer, Van Bang Le, Vadim V. Lozin Bisplit graphs. Search on Bibsonomy Discrete Mathematics The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Raffaele Mosca New Graph Classes of Bounded Clique-Width. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Andreas Brandstädt, Dieter Kratsch On the structure of (P5, gem)-free graphs. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Andreas Brandstädt, Hoàng-Oanh Le, Raffaele Mosca Chordal co-gem-free and (P5, gem)-free graphs have bounded clique-width. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Andreas Brandstädt, Van Bang Le, Suhail Mahfud New Applications of Clique Separator Decomposition for the Maximum Weight Stable Set Problem. Search on Bibsonomy FCT The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Andreas Brandstädt, Joost Engelfriet, Hoàng-Oanh Le, Vadim V. Lozin Clique-Width for Four-Vertex Forbidden Subgraphs. Search on Bibsonomy FCT The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Andreas Brandstädt, Chính T. Hoàng On Clique Separators, Nearly Chordal Graphs, and the Maximum Weight Stable Set Problem. Search on Bibsonomy IPCO The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Andreas Brandstädt, Van Bang Le, H. N. de Ridder Efficient robust algorithms for the Maximum Weight Stable Set Problem in chair-free graph classes. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Van Bang Le Tree spanners on chordal graphs: complexity and algorithms. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Andreas Brandstädt, Hoàng-Oanh Le, Raffaele Mosca Gem- And Co-Gem-Free Graphs Have Bounded Clique-Width. Search on Bibsonomy Int. J. Found. Comput. Sci. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Andreas Brandstädt, Chính T. Hoàng, Jean-Marie Vanherpe On minimal prime extensions of a four-vertex graph in a prime graph. Search on Bibsonomy Discrete Mathematics The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Andreas Brandstädt, Van Bang Le Split-Perfect Graphs: Characterizations and Algorithmic Use. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Andreas Brandstädt, Konrad Engel, Hans-Dietrich O. F. Gronau, Roger Labahn Preface: ODSA. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Andreas Brandstädt (P5, diamond)-free graphs revisited: structure and linear time optimization. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Andreas Brandstädt, Hoàng-Oanh Le, Jean-Marie Vanherpe Structure and stability number of chair-, co-P- and gem-free graphs revisited. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Andreas Brandstädt, Raffaele Mosca On the structure and stability number of P5- and co-chair-free graphs. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Andreas Brandstädt, Feodor F. Dragan On linear and circular structure of (claw, net)-free graphs. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Andreas Brandstädt, Chính T. Hoàng, Van Bang Le Stability number of bull- and chair-free graphs revisited. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Andreas Brandstädt, Raffaele Mosca On variations of P4-sparse graphs. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Andreas Brandstädt, Vadim V. Lozin On the linear structure and clique-width of bipartite permutation graphs. Search on Bibsonomy Ars Comb. The full citation details ... 2003 DBLP  BibTeX  RDF
1Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Van Bang Le, Ryuhei Uehara Tree Spanners for Bipartite Graphs and Probe Interval Graphs. Search on Bibsonomy WG The full citation details ... 2003 DBLP  DOI  BibTeX  RDF Chordal bipartite graph, Interval bigraph, Probe interval graph, Tree spanner, NP-completeness
1Hans L. Bodlaender, Andreas Brandstädt, Dieter Kratsch, Michaël Rao, Jeremy Spinrad Linear Time Algorithms for Some NP-Complete Problems on (P5, Gem)-Free Graphs. Search on Bibsonomy FCT The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Andreas Brandstädt, Hoàng-Oanh Le, Van Bang Le On alpha-redundant vertices in P5-free graphs. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Andreas Brandstädt, Suhail Mahfud Maximum Weight Stable Set on graphs without claw and co-claw (and similar graph classes) can be solved in linear time. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Luitpold Babel, Andreas Brandstädt, Van Bang Le Recognizing the P4-structure of claw-free graphs and a larger graph class. Search on Bibsonomy Discrete Mathematics & Theoretical Computer Science The full citation details ... 2002 DBLP  BibTeX  RDF
1Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Raffaele Mosca New Graph Classes of Bounded Clique-Width. Search on Bibsonomy WG The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Van Bang Le Tree Spanners on Chordal Graphs: Complexity, Algorithms, Open Problems. Search on Bibsonomy ISAAC The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Andreas Brandstädt, Vadim V. Lozin A note on alpha-redundant vertices in graphs. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Andreas Brandstädt, Van Bang Le (eds.) Graph-Theoretic Concepts in Computer Science, 27th International Workshop, WG 2001, Boltenhagen, Germany, June 14-16, 2001, Proceedings Search on Bibsonomy WG The full citation details ... 2001 DBLP  BibTeX  RDF
1Andreas Brandstädt On Robust Algorithms for the Maximum Weight Stable Set Problem. Search on Bibsonomy FCT The full citation details ... 2001 DBLP  DOI  BibTeX  RDF Maximum Weight Stable Set Problem on graphs, modules and homogeneous sets in graphs, graph structure, clique width, robust algorithms, prime graphs
1Andreas Brandstädt, Van Bang Le, Stephan Olariu Efficiently Recognizing the P 4-Structure of Trees and of Bipartite Graphs Without Short Cycles. Search on Bibsonomy Graphs and Combinatorics The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1Andreas Brandstädt, Van Bang Le Recognizing the P4-structure of Block Graphs. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1Andreas Brandstädt, Feodor F. Dragan, Van Bang Le, Thomas Szymczak On stable cutsets in graphs. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1Andreas Brandstädt, Feodor F. Dragan, Ekkehard Köhler Linear Time Algorithms for Hamiltonian Problems on (Claw, Net)-Free Graphs. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1Andreas Brandstädt, Van Bang Le Split-Perfect Graphs: Characterizations and Algorithmic Use. Search on Bibsonomy WG The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1Andreas Brandstädt, Victor Chepoi, Feodor F. Dragan Distance Approximating Trees for Chordal and Dually Chordal Graphs. Search on Bibsonomy J. Algorithms The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
1Feodor F. Dragan, Falk Nicolai, Andreas Brandstädt Convexity and HHD-Free Graphs. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
1Andreas Brandstädt, Van Bang Le Tree- and Forest-perfect Graphs. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
1Luitpold Babel, Andreas Brandstädt, Van Bang Le Recognizing the P4-structure of Bipartite Graphs. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
1Andreas Brandstädt, Peter L. Hammer On the Stability Number of Claw-free P5-free and More General Graphs. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
1Andreas Brandstädt, Feodor F. Dragan, Ekkehard Köhler Linear Time Algorithms for Hamiltonian Problems on (Claw, Net)-Free Graphs. Search on Bibsonomy WG The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
1Andreas Brandstädt Corrigendum. Search on Bibsonomy Discrete Mathematics The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
1Andreas Brandstädt, Feodor F. Dragan A linear-time algorithm for connected r-domination and Steiner tree on distance-hereditary graphs. Search on Bibsonomy Networks The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
1Andreas Brandstädt, Feodor F. Dragan, Victor Chepoi, Vitaly I. Voloshin Dually Chordal Graphs. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
1Andreas Brandstädt, Van Bang Le, Thomas Szymczak The Complexity of some Problems Related to Graph 3-colorability. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
1Andreas Brandstädt, Victor Chepoi, Feodor F. Dragan The Algorithmic Use of Hypertree Structure and Maximum Neighbourhood Orderings. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
1Andreas Brandstädt, Feodor F. Dragan, Falk Nicolai Homogeneously Orderable Graphs. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
1Andreas Brandstädt, Van Bang Le, Thomas Szymczak Duchet-type theorems for powers of HHD-free graphs. Search on Bibsonomy Discrete Mathematics The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
1Andreas Brandstädt, Feodor F. Dragan, Falk Nicolai LexBFS-orderings and powers of chordal graphs. Search on Bibsonomy Discrete Mathematics The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
1Andreas Brandstädt, Victor Chepoi, Feodor F. Dragan Clique r-Domination and Clique r-Packing Problems on Dually Chordal Graphs. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
1Andreas Brandstädt, Victor Chepoi, Feodor F. Dragan Distance Approximating Trees for Chordal and Dually Chordal Graphs (Extended Abstract). Search on Bibsonomy ESA The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
1Feodor F. Dragan, Andreas Brandstädt r-Dominating cliques in graphs with hypertree structure. Search on Bibsonomy Discrete Mathematics The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
1Andreas Brandstädt Partitions of graphs into one or two independent sets and cliques. Search on Bibsonomy Discrete Mathematics The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
1Andreas Brandstädt, Victor Chepoi, Feodor F. Dragan Perfect elimination orderings of chordal powers of graphs. Search on Bibsonomy Discrete Mathematics The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
1Andreas Brandstädt, Heinz-Jürgen Voss Short Disjoint Cycles in Graphs with Degree Constraints. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
1Feodor F. Dragan, Falk Nicolai, Andreas Brandstädt LexBFS-Orderings and Power of Graphs. Search on Bibsonomy WG The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
1Andreas Brandstädt, Feodor F. Dragan, Falk Nicolai Homogeneously Orderable Graphs and the Steiner Tree Problem. Search on Bibsonomy WG The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
1Andreas Brandstädt Graphen und Algorithmen. Search on Bibsonomy 1994   RDF
1Andreas Brandstädt, Victor Chepoi, Feodor F. Dragan The Algorithmic Use of Hypertree Structure and Maximum Neighbourhood Orderings. Search on Bibsonomy WG The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
1Feodor F. Dragan, Andreas Brandstädt Dominating Cliques in Graphs with Hypertree Structures. Search on Bibsonomy STACS The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #100 of 119 (100 per page; Change: )
Pages: [1][2][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.