default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVan Bang Le
- > Home > Persons > Van Bang Le
Publications
- 2014
[j61]Andreas Brandstädt, Konrad Engel, Hans-Dietrich O. F. Gronau, Roger Labahn, Van Bang Le, Florian Pfender
:
Preface. Discret. Appl. Math. 163: 101 (2014)- [j59]Andreas Brandstädt, Van Bang Le:
A note on efficient domination in a superclass of P5-free graphs. Inf. Process. Lett. 114(7): 357-359 (2014) - 2011
- [j51]Andreas Brandstädt, Martin Charles Golumbic, Van Bang Le, Marina Lipshteyn:
Path-Bicolorable Graphs. Graphs Comb. 27(6): 799-819 (2011) - 2010
- [j48]Andreas Brandstädt, Van Bang Le, Dieter Rautenbach:
Exact leaf powers. Theor. Comput. Sci. 411(31-33): 2968-2977 (2010) - 2009
- [j47]Andreas Brandstädt, Konrad Engel, Hans-Dietrich O. F. Gronau, Van Bang Le:
Preface. Discret. Appl. Math. 157(9): 1979 (2009) - [j46]Andreas Brandstädt, Van Bang Le, Dieter Rautenbach:
A forbidden induced subgraph characterization of distance-hereditary 5-leaf powers. Discret. Math. 309(12): 3843-3852 (2009) - [j44]Andreas Brandstädt, Van Bang Le:
Simplicial powers of graphs. Theor. Comput. Sci. 410(52): 5443-5454 (2009) - [c13]Andreas Brandstädt, Martin Charles Golumbic, Van Bang Le, Marina Lipshteyn:
Path-Bicolorable Graphs. Graph Theory, Computational Intelligence and Thought 2009: 172-182 - 2008
- [j42]Andreas Brandstädt, Van Bang Le, R. Sritharan:
Structure and linear-time recognition of 4-leaf powers. ACM Trans. Algorithms 5(1): 11:1-11:22 (2008) - [c10]Andreas Brandstädt, Van Bang Le:
Simplicial Powers of Graphs. COCOA 2008: 160-170 - 2007
- [j41]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 47(1): 27-51 (2007) - [j39]Andreas Brandstädt, Van Bang Le, Suhail Mahfud:
New applications of clique separator decomposition for the Maximum Weight Stable Set problem. Theor. Comput. Sci. 370(1-3): 229-239 (2007) - 2006
- [j35]Dieter Rautenbach, Andreas Brandstädt, Van Bang Le:
Distance-Hereditary 5-Leaf Powers. Electron. Notes Discret. Math. 27: 85-86 (2006) - [j34]Andreas Brandstädt, Van Bang Le:
Structure and linear time recognition of 3-leaf powers. Inf. Process. Lett. 98(4): 133-138 (2006) - 2005
- [j33]Andreas Brandstädt, Peter L. Hammer, Van Bang Le, Vadim V. Lozin:
Bisplit graphs. Discret. Math. 299(1-3): 11-32 (2005) - [c7]Andreas Brandstädt, Van Bang Le, Suhail Mahfud:
New Applications of Clique Separator Decomposition for the Maximum Weight Stable Set Problem. FCT 2005: 516-527 - 2004
- [j31]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. 89(4): 165-173 (2004) - [j30]Andreas Brandstädt, Van Bang Le:
Split-Perfect Graphs: Characterizations and Algorithmic Use. SIAM J. Discret. Math. 17(3): 341-360 (2004) - [j29]Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Van Bang Le:
Tree spanners on chordal graphs: complexity and algorithms. Theor. Comput. Sci. 310(1-3): 329-354 (2004) - 2003
- [j27]Andreas Brandstädt, Chính T. Hoàng, Van Bang Le:
Stability number of bull- and chair-free graphs revisited. Discret. Appl. Math. 131(1): 39-50 (2003) - [c5]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: 106-118 - 2002
- [j23]Luitpold Babel, Andreas Brandstädt, Van Bang Le:
Recognizing the P4-structure of claw-free graphs and a larger graph class. Discret. Math. Theor. Comput. Sci. 5(1): 127-146 (2002) - [j21]Andreas Brandstädt, Hoàng-Oanh Le, Van Bang Le:
On alpha-redundant vertices in P5-free graphs. Inf. Process. Lett. 82(3): 119-122 (2002) - [c4]Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Van Bang Le:
Tree Spanners on Chordal Graphs: Complexity, Algorithms, Open Problems. ISAAC 2002: 163-174 - 2001
- [e1]Andreas Brandstädt, Van Bang Le:
Graph-Theoretic Concepts in Computer Science, 27th International Workshop, WG 2001, Boltenhagen, Germany, June 14-16, 2001, Proceedings. Lecture Notes in Computer Science 2204, Springer 2001, ISBN 3-540-42707-4 [contents] - 2000
- [j19]Andreas Brandstädt, Van Bang Le:
Recognizing the P4-structure of Block Graphs. Discret. Appl. Math. 99(1-3): 349-366 (2000) - [j18]Andreas Brandstädt, Feodor F. Dragan, Van Bang Le, Thomas Szymczak:
On stable cutsets in graphs. Discret. Appl. Math. 105(1-3): 39-50 (2000) - [j15]Andreas Brandstädt, Van Bang Le, Stephan Olariu:
Efficiently Recognizing the P 4-Structure of Trees and of Bipartite Graphs Without Short Cycles. Graphs Comb. 16(4): 381-387 (2000) - [c1]Andreas Brandstädt, Van Bang Le:
Split-Perfect Graphs: Characterizations and Algorithmic Use. WG 2000: 71-82 - 1999
- [j13]Luitpold Babel, Andreas Brandstädt, Van Bang Le:
Recognizing the P4-structure of Bipartite Graphs. Discret. Appl. Math. 93(2-3): 157-168 (1999) - [j12]Andreas Brandstädt, Van Bang Le:
Tree- and Forest-perfect Graphs. Discret. Appl. Math. 95(1-3): 141-162 (1999) - 1998
- [j8]Andreas Brandstädt, Van Bang Le, Thomas Szymczak:
The Complexity of some Problems Related to Graph 3-colorability. Discret. Appl. Math. 89(1-3): 59-73 (1998) - 1997
- [j7]Andreas Brandstädt, Van Bang Le, Thomas Szymczak:
Duchet-type theorems for powers of HHD-free graphs. Discret. Math. 177(1-3): 9-16 (1997)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-19 00:34 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
