| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Babak Farzad, Lap Chi Lau, Van Bang Le, Nguyen Ngoc Tuy |
Complexity of Finding Graph Roots with Girth Conditions.  |
Algorithmica  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Van Bang Le, Nguyen Ngoc Tuy |
A good characterization of squares of strongly chordal split graphs.  |
Inf. Process. Lett.  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Brandstädt, Martin Charles Golumbic, Van Bang Le, Marina Lipshteyn |
Path-Bicolorable Graphs.  |
Graphs and Combinatorics  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Van Bang Le |
Two characterizations of chain partitioned probe graphs.  |
Annals OR  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Van Bang Le, Ragnar Nevries |
Recognizing Polar Planar Graphs Using New Results for Monopolarity.  |
ISAAC  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Brandstädt, Van Bang Le, Dieter Rautenbach |
Exact leaf powers.  |
Theor. Comput. Sci.  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Van Bang Le, Nguyen Ngoc Tuy |
The square of a block graph.  |
Discrete Mathematics  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Bayer, Van Bang Le, H. N. de Ridder |
Probe threshold and probe trivially perfect graphs.  |
Theor. Comput. Sci.  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Brandstädt, Van Bang Le |
Simplicial powers of graphs.  |
Theor. Comput. Sci.  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Brandstädt, Van Bang Le, Dieter Rautenbach |
A forbidden induced subgraph characterization of distance-hereditary 5-leaf powers.  |
Discrete Mathematics  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Babak Farzad, Lap Chi Lau, Van Bang Le, Nguyen Ngoc Tuy |
Computing Graph Roots Without Short Cycles  |
CoRR  |
2009 |
DBLP BibTeX RDF |
|
| 1 | Andreas Brandstädt, Konrad Engel, Hans-Dietrich O. F. Gronau, Van Bang Le |
Preface.  |
Discrete Applied Mathematics  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Van Bang Le, Nguyen Ngoc Tuy |
Hardness Results and Efficient Algorithms for Graph Powers.  |
WG  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Babak Farzad, Lap Chi Lau, Van Bang Le, Nguyen Ngoc Tuy |
Computing Graph Roots Without Short Cycles.  |
STACS  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Brandstädt, Martin Charles Golumbic, Van Bang Le, Marina Lipshteyn |
Path-Bicolorable Graphs.  |
Graph Theory, Computational Intelligence and Thought  |
2009 |
DBLP DOI BibTeX RDF |
P 3-bicolorable graphs, P 4-bicolorable graphs, linear time recognition, bipartite graphs |
| 1 | Andreas Brandstädt, Van Bang Le, R. Sritharan |
Structure and linear-time recognition of 4-leaf powers.  |
ACM Transactions on Algorithms  |
2008 |
DBLP DOI BibTeX RDF |
squares of trees, trees, phylogenetic trees, leaf powers, Graph powers |
| 1 | Van Bang Le, Raffaele Mosca, Haiko Müller |
On stable cutsets in claw-free graphs and planar graphs.  |
J. Discrete Algorithms  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Brandstädt, Van Bang Le |
Simplicial Powers of Graphs.  |
COCOA  |
2008 |
DBLP DOI BibTeX RDF |
simplicial powers, forbidden induced subgraph characterization, block graphs, ptolemaic graphs, strongly chordal graphs, chordal graphs, leaf powers, Graph powers |
| 1 | David B. Chandler, Maw-Shang Chang, Ton Kloks, Van Bang Le, Sheng-Lung Peng |
Probe Ptolemaic Graphs.  |
COCOON  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Brandstädt, Van Bang Le, Suhail Mahfud |
New applications of clique separator decomposition for the Maximum Weight Stable Set problem.  |
Theor. Comput. Sci.  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Van Bang Le, Bert Randerath, Ingo Schiermeyer |
On the complexity of 4-coloring graphs without long induced paths.  |
Theor. Comput. Sci.  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Van Bang Le, H. N. de Ridder |
Probe Split Graphs.  |
Discrete Mathematics & Theoretical Computer Science  |
2007 |
DBLP BibTeX RDF |
|
| 1 | Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Van Bang Le, Ryuhei Uehara |
Tree Spanners for Bipartite Graphs and Probe Interval Graphs.  |
Algorithmica  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Van Bang Le, H. N. de Ridder |
Characterisations and Linear-Time Recognition of Probe Cographs.  |
WG  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Van Bang Le, H. N. de Ridder |
Linear-time certifying recognition for partitioned probe cographs.  |
Exact, Approximative, Robust and Certifying Algorithms on Particular Graph Classes  |
2007 |
DBLP BibTeX RDF |
|
| 1 | Dieter Rautenbach, Andreas Brandstädt, Van Bang Le |
Distance-Hereditary 5-Leaf Powers.  |
Electronic Notes in Discrete Mathematics  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | H. N. de Ridder, Van Bang Le, Daniel Bayer |
On probe classes of graphs.  |
Electronic Notes in Discrete Mathematics  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Nguyen Ngoc Tuy, Jörg Bornemann, Van Bang Le |
Graph classes related to chordal graphs and chordal bipartite graphs.  |
Electronic Notes in Discrete Mathematics  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Brandstädt, Van Bang Le |
Structure and linear time recognition of 3-leaf powers.  |
Inf. Process. Lett.  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Brandstädt, Peter L. Hammer, Van Bang Le, Vadim V. Lozin |
Bisplit graphs.  |
Discrete Mathematics  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Van Bang Le, Raffaele Mosca, Haiko Müller |
On Stable Cutsets in Claw-Free Graphs and Planar Graphs.  |
WG  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Brandstädt, Van Bang Le, Suhail Mahfud |
New Applications of Clique Separator Decomposition for the Maximum Weight Stable Set Problem.  |
FCT  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Brandstädt, Van Bang Le, H. N. de Ridder |
Efficient robust algorithms for the Maximum Weight Stable Set Problem in chair-free graph classes.  |
Inf. Process. Lett.  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Van Bang Le |
Tree spanners on chordal graphs: complexity and algorithms.  |
Theor. Comput. Sci.  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Van Bang Le, Jeremy Spinrad |
Consequences of an algorithm for bridged graphs.  |
Discrete Mathematics  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Brandstädt, Van Bang Le |
Split-Perfect Graphs: Characterizations and Algorithmic Use.  |
SIAM J. Discrete Math.  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Van Bang Le, Bert Randerath |
On stable cutsets in line graphs.  |
Theor. Comput. Sci.  |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Jirí Fiala, Klaus Jansen, Van Bang Le, Eike Seidel |
Graph Subcolorings: Complexity and Algorithms.  |
SIAM J. Discrete Math.  |
2003 |
DBLP BibTeX RDF |
|
| 1 | Hoàng-Oanh Le, Van Bang Le, Haiko Müller |
Splitting a graph into disjoint induced paths or cycles.  |
Discrete Applied Mathematics  |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Brandstädt, Chính T. Hoàng, Van Bang Le |
Stability number of bull- and chair-free graphs revisited.  |
Discrete Applied Mathematics  |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Van Bang Le |
Bipartite-perfect Graphs.  |
Discrete Applied Mathematics  |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Van Bang Le, Ryuhei Uehara |
Tree Spanners for Bipartite Graphs and Probe Interval Graphs.  |
WG  |
2003 |
DBLP DOI BibTeX RDF |
Chordal bipartite graph, Interval bigraph, Probe interval graph, Tree spanner, NP-completeness |
| 1 | Hoàng-Oanh Le, Van Bang Le |
The NP-completeness of (1, r)-subcolorability of cubic graphs.  |
Inf. Process. Lett.  |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Brandstädt, Hoàng-Oanh Le, Van Bang Le |
On alpha-redundant vertices in P5-free graphs.  |
Inf. Process. Lett.  |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Luitpold Babel, Andreas Brandstädt, Van Bang Le |
Recognizing the P4-structure of claw-free graphs and a larger graph class.  |
Discrete Mathematics & Theoretical Computer Science  |
2002 |
DBLP BibTeX RDF |
|
| 1 | Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Van Bang Le |
Tree Spanners on Chordal Graphs: Complexity, Algorithms, Open Problems.  |
ISAAC  |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Chính T. Hoàng, Van Bang Le |
P4-Colorings and P4-Bipartite Graphs.  |
Discrete Mathematics & Theoretical Computer Science  |
2001 |
DBLP BibTeX RDF |
|
| 1 | Jirí Fiala, Klaus Jansen, Van Bang Le, Eike Seidel |
Graph Subcolorings: Complexity and Algorithms.  |
WG  |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Brandstädt, Van Bang Le (eds.) |
Graph-Theoretic Concepts in Computer Science, 27th International Workshop, WG 2001, Boltenhagen, Germany, June 14-16, 2001, Proceedings  |
WG  |
2001 |
DBLP BibTeX RDF |
|
| 1 | Van Bang Le, Bert Randerath |
On Stable Cutsets in Line Graphs.  |
WG  |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Chính T. Hoàng, Van Bang Le |
On P4-transversals of perfect graphs.  |
Discrete Mathematics  |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Brandstädt, Van Bang Le, Stephan Olariu |
Efficiently Recognizing the P 4-Structure of Trees and of Bipartite Graphs Without Short Cycles.  |
Graphs and Combinatorics  |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Chính T. Hoàng, Van Bang Le |
Recognizing Perfect 2-Split Graphs.  |
SIAM J. Discrete Math.  |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Brandstädt, Van Bang Le |
Recognizing the P4-structure of Block Graphs.  |
Discrete Applied Mathematics  |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Brandstädt, Feodor F. Dragan, Van Bang Le, Thomas Szymczak |
On stable cutsets in graphs.  |
Discrete Applied Mathematics  |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Brandstädt, Van Bang Le |
Split-Perfect Graphs: Characterizations and Algorithmic Use.  |
WG  |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Van Bang Le |
Bipartite-Perfect Graphs.  |
Electronic Notes in Discrete Mathematics  |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Hoàng-Oanh Le, Van Bang Le |
Optimal tree 3-spanners in directed path graphs.  |
Networks  |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Brandstädt, Van Bang Le |
Tree- and Forest-perfect Graphs.  |
Discrete Applied Mathematics  |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Luitpold Babel, Andreas Brandstädt, Van Bang Le |
Recognizing the P4-structure of Bipartite Graphs.  |
Discrete Applied Mathematics  |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Brandstädt, Van Bang Le, Thomas Szymczak |
The Complexity of some Problems Related to Graph 3-colorability.  |
Discrete Applied Mathematics  |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Brandstädt, Van Bang Le, Thomas Szymczak |
Duchet-type theorems for powers of HHD-free graphs.  |
Discrete Mathematics  |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Van Bang Le |
Gallai graphs and anti-Gallai graphs.  |
Discrete Mathematics  |
1996 |
DBLP DOI BibTeX RDF |
|