Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Le, Van Bang"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Characterizing and recognizing probe block graphs
Van Bang Le
,
Sheng-Lung Peng
Theoretical Computer Science
568
, 2015, pp. 97-102
A note on efficient domination in a superclass of
P_5
-free graphs
Andreas Brandstädt
,
Van Bang Le
Information Processing Letters
114
(7), 2014, pp. 357-359
Complexity and algorithms for recognizing polar and monopolar graphs
Van Bang Le
,
Ragnar Nevries
Theoretical Computer Science
528
, 2014, pp. 1-11
Polynomial time recognition of squares of Ptolemaic graphs and 3-sun-free split graphs
Van Bang Le
,
Andrea Oversberg
,
Oliver Schaudt
Lecture Notes in Computer Science
8747
, 2014, pp. 360-371
Complexity results for rainbow matchings
Van Bang Le
,
Florian Pfender
Theoretical Computer Science
524
, 2014, pp. 27-33
Complexity of finding graph roots with girth conditions
Babak Farzad
,
Lap Chi Lau
,
Van Bang Le
,
Nguyen Ngoc Tuy
Algorithmica
62
(1-2), 2012, pp. 38-53
Integral mixed unit interval graphs
Van Bang Le
,
Dieter Rautenbach
Lecture Notes in Computer Science
7434
, 2012, pp. 495-506
Path-bicolorable graphs
Andreas Brandstädt
,
Martin Charles Golumbic
,
Van Bang Le
,
Marina Lipshteyn
Graphs and Combinatorics
27
(6), 2011, pp. 799-819
Recognizing polar planar graphs using new results for monopolarity
Van Bang Le
,
Ragnar Nevries
Lecture Notes in Computer Science
7074
, 2011, pp. 120-129
A good characterization of squares of strongly chordal split graphs
Van Bang Le
,
Ngoc Tuy Nguyen
Information Processing Letters
111
(3), 2011, pp. 120-123
Exact leaf powers
Andreas Brandstädt
,
Van Bang Le
,
Dieter Rautenbach
Theoretical Computer Science
411
(31-33), 2010, pp. 2968-2977
Hardness results and efficient algorithms for graph powers
Van Bang Le
,
Ngoc Tuy Nguyen
Lecture Notes in Computer Science
5911
, 2010, pp. 238-249
Probe threshold and probe trivially perfect graphs
Daniel Bayer
,
Van Bang Le
,
H.N. de Ridder
Theoretical Computer Science
410
(47-49), 2009, pp. 4812-4822
Simplicial powers of graphs
Andreas Brandstädt
,
Van Bang Le
Theoretical Computer Science
410
(52), 2009, pp. 5443-5454
Computing graph roots without short cycles
Babak Farzad
,
Lap Chi Lau
,
Van Bang Le
,
Nguyen Ngoc Tuy
Leibniz International Proceedings in Informatics (LIPIcs)
3
, 2009, pp. 397-408
Probe ptolemaic graphs
David B. Chandler
,
Maw-Shang Chang
,
Ton Kloks
,
Van Bang Le
,
Sheng-Lung Peng
Lecture Notes in Computer Science
5092
, 2008, pp. 468-477
Probe ptolemaic graphs
David B. Chandler
,
Maw-Shang Chang
,
Ton Kloks
,
Van Bang Le
,
Sheng-Lung Peng
Lecture Notes in Computer Science
5092
, 2008, pp. 468-477
Tree spanners for bipartite graphs and probe interval graphs
Andreas Brandstädt
,
Feodor F. Dragan
,
Hoang-Oanh Le
,
Van Bang Le
,
Ryuhei Uehara
Algorithmica
47
(1), 2007, pp. 27-51
New applications of clique separator decomposition for the Maximum Weight Stable Set problem
Andreas Brandstädt
,
Van Bang Le
,
Suhail Mahfud
Theoretical Computer Science
370
(1-3), 2007, pp. 229-239
On the complexity of 4-coloring graphs without long induced paths
Van Bang Le
,
Bert Randerath
,
Ingo Schiermeyer
Theoretical Computer Science
389
(1-2), 2007, pp. 330-335
Characterisations and linear-time recognition of probe cographs
Van Bang Le
,
H.N. de Ridder
Lecture Notes in Computer Science
4769
, 2007, pp. 226-237
Structure and linear time recognition of 3-leaf powers
Andreas Brandstädt
,
Van Bang Le
Information Processing Letters
98
(4), 2006, pp. 133-138
On stable cutsets in claw-free graphs and planar graphs
Van Bang Le
,
Raffaele Mosca
,
Haiko Müller
Lecture Notes in Computer Science
3787
, 2005, pp. 163-174
Tree spanners on chordal graphs: Complexity and algorithms
Andreas Brandstädt
,
Feodor F. Dragan
,
Hoàng-Oanh Le
,
Van Bang Le
Theoretical Computer Science
310
(1-3), 2004, pp. 329-354
Efficient robust algorithms for the maximum weight stable set problem in chair-free graph classes
Andreas Brandstädt
,
Van Bang Le
,
H.N. de Ridder
Information Processing Letters
89
(4), 2004, pp. 165-173
Seiten 1
2
3
>