Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Van Bang Le
@article{DBLP:journals/algorithmica/HsiehLLP24,
author = {Sun{-}Yuan Hsieh and
Ho{\`{a}}ng{-}Oanh Le and
Van Bang Le and
Sheng{-}Lung Peng},
title = {On the d-Claw Vertex Deletion Problem},
journal = {Algorithmica},
volume = {86},
number = {2},
pages = {505--525},
year = {2024},
url = {https://doi.org/10.1007/s00453-023-01144-w},
doi = {10.1007/S00453-023-01144-W},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/HsiehLLP24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/LeL24,
author = {Ho{\`{a}}ng{-}Oanh Le and
Van Bang Le},
title = {Complexity of the (Connected) Cluster Vertex Deletion Problem on H-free
Graphs},
journal = {Theory Comput. Syst.},
volume = {68},
number = {2},
pages = {250--270},
year = {2024},
url = {https://doi.org/10.1007/s00224-024-10161-3},
doi = {10.1007/S00224-024-10161-3},
timestamp = {Thu, 11 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/LeL24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2402-04931,
author = {Ho{\`{a}}ng{-}Oanh Le and
Van Bang Le},
title = {Complexity of the (Connected) Cluster Vertex Deletion problem on H-free
graphs},
journal = {CoRR},
volume = {abs/2402.04931},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2402.04931},
doi = {10.48550/ARXIV.2402.04931},
eprinttype = {arXiv},
eprint = {2402.04931},
timestamp = {Wed, 14 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2402-04931.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fct/LeR23,
author = {Van Bang Le and
Christian Rosenke},
editor = {Henning Fernau and
Klaus Jansen},
title = {Computing Optimal Leaf Roots of Chordal Cographs in Linear Time},
booktitle = {Fundamentals of Computation Theory - 24th International Symposium,
{FCT} 2023, Trier, Germany, September 18-21, 2023, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {14292},
pages = {348--362},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-43587-4\_25},
doi = {10.1007/978-3-031-43587-4\_25},
timestamp = {Fri, 27 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fct/LeR23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/LeL23,
author = {Ho{\`{a}}ng{-}Oanh Le and
Van Bang Le},
editor = {Dani{\"{e}}l Paulusma and
Bernard Ries},
title = {Complexity Results for Matching Cut Problems in Graphs Without Long
Induced Paths},
booktitle = {Graph-Theoretic Concepts in Computer Science - 49th International
Workshop, {WG} 2023, Fribourg, Switzerland, June 28-30, 2023, Revised
Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {14093},
pages = {417--431},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-43380-1\_30},
doi = {10.1007/978-3-031-43380-1\_30},
timestamp = {Wed, 27 Sep 2023 09:00:02 +0200},
biburl = {https://dblp.org/rec/conf/wg/LeL23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2307-05402,
author = {Ho{\`{a}}ng{-}Oanh Le and
Van Bang Le},
title = {Complexity results for matching cut problems in graphs without long
induced paths},
journal = {CoRR},
volume = {abs/2307.05402},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2307.05402},
doi = {10.48550/ARXIV.2307.05402},
eprinttype = {arXiv},
eprint = {2307.05402},
timestamp = {Mon, 24 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2307-05402.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2308-10756,
author = {Van Bang Le and
Christian Rosenke},
title = {Computing Optimal Leaf Roots of Chordal Cographs in Linear Time},
journal = {CoRR},
volume = {abs/2308.10756},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2308.10756},
doi = {10.48550/ARXIV.2308.10756},
eprinttype = {arXiv},
eprint = {2308.10756},
timestamp = {Fri, 25 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2308-10756.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2312-12960,
author = {Van Bang Le and
Felicia Lucke and
Dani{\"{e}}l Paulusma and
Bernard Ries},
title = {Maximizing Matching Cuts},
journal = {CoRR},
volume = {abs/2312.12960},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2312.12960},
doi = {10.48550/ARXIV.2312.12960},
eprinttype = {arXiv},
eprint = {2312.12960},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2312-12960.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/GolovachKKL22,
author = {Petr A. Golovach and
Christian Komusiewicz and
Dieter Kratsch and
Van Bang Le},
title = {Refined notions of parameterized enumeration kernels with applications
to matching cut enumeration},
journal = {J. Comput. Syst. Sci.},
volume = {123},
pages = {76--102},
year = {2022},
url = {https://doi.org/10.1016/j.jcss.2021.07.005},
doi = {10.1016/J.JCSS.2021.07.005},
timestamp = {Wed, 03 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/GolovachKKL22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/LeT22,
author = {Van Bang Le and
Jan Arne Telle},
title = {The perfect matching cut problem revisited},
journal = {Theor. Comput. Sci.},
volume = {931},
pages = {117--130},
year = {2022},
url = {https://doi.org/10.1016/j.tcs.2022.07.035},
doi = {10.1016/J.TCS.2022.07.035},
timestamp = {Fri, 09 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/LeT22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/LeL22,
author = {Ho{\`{a}}ng{-}Oanh Le and
Van Bang Le},
editor = {Stefan Szeider and
Robert Ganian and
Alexandra Silva},
title = {Complexity of the Cluster Vertex Deletion Problem on H-Free Graphs},
booktitle = {47th International Symposium on Mathematical Foundations of Computer
Science, {MFCS} 2022, August 22-26, 2022, Vienna, Austria},
series = {LIPIcs},
volume = {241},
pages = {68:1--68:10},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.MFCS.2022.68},
doi = {10.4230/LIPICS.MFCS.2022.68},
timestamp = {Mon, 26 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/LeL22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2203-06766,
author = {Sun{-}Yuan Hsieh and
Ho{\`{a}}ng{-}Oanh Le and
Van Bang Le and
Sheng{-}Lung Peng},
title = {On the d-Claw Vertex Deletion Problem},
journal = {CoRR},
volume = {abs/2203.06766},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2203.06766},
doi = {10.48550/ARXIV.2203.06766},
eprinttype = {arXiv},
eprint = {2203.06766},
timestamp = {Wed, 16 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2203-06766.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ChenHLLP21,
author = {Chi{-}Yeh Chen and
Sun{-}Yuan Hsieh and
Ho{\`{a}}ng{-}Oanh Le and
Van Bang Le and
Sheng{-}Lung Peng},
title = {Matching Cut in Graphs with Large Minimum Degree},
journal = {Algorithmica},
volume = {83},
number = {5},
pages = {1238--1255},
year = {2021},
url = {https://doi.org/10.1007/s00453-020-00782-8},
doi = {10.1007/S00453-020-00782-8},
timestamp = {Thu, 16 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/ChenHLLP21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/HsiehLP21,
author = {Sun{-}Yuan Hsieh and
Van Bang Le and
Sheng{-}Lung Peng},
editor = {Chi{-}Yeh Chen and
Wing{-}Kai Hon and
Ling{-}Ju Hung and
Chia{-}Wei Lee},
title = {On the d-Claw Vertex Deletion Problem},
booktitle = {Computing and Combinatorics - 27th International Conference, {COCOON}
2021, Tainan, Taiwan, October 24-26, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13025},
pages = {591--603},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-89543-3\_49},
doi = {10.1007/978-3-030-89543-3\_49},
timestamp = {Fri, 22 Oct 2021 15:23:41 +0200},
biburl = {https://dblp.org/rec/conf/cocoon/HsiehLP21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/GolovachKKL21,
author = {Petr A. Golovach and
Christian Komusiewicz and
Dieter Kratsch and
Van Bang Le},
editor = {Markus Bl{\"{a}}ser and
Benjamin Monmege},
title = {Refined Notions of Parameterized Enumeration Kernels with Applications
to Matching Cut Enumeration},
booktitle = {38th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2021, March 16-19, 2021, Saarbr{\"{u}}cken, Germany (Virtual
Conference)},
series = {LIPIcs},
volume = {187},
pages = {37:1--37:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.STACS.2021.37},
doi = {10.4230/LIPICS.STACS.2021.37},
timestamp = {Thu, 11 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stacs/GolovachKKL21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/LeT21,
author = {Van Bang Le and
Jan Arne Telle},
editor = {Lukasz Kowalik and
Michal Pilipczuk and
Pawel Rzazewski},
title = {The Perfect Matching Cut Problem Revisited},
booktitle = {Graph-Theoretic Concepts in Computer Science - 47th International
Workshop, {WG} 2021, Warsaw, Poland, June 23-25, 2021, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {12911},
pages = {182--194},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-86838-3\_14},
doi = {10.1007/978-3-030-86838-3\_14},
timestamp = {Tue, 21 Sep 2021 19:14:12 +0200},
biburl = {https://dblp.org/rec/conf/wg/LeT21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2101-03800,
author = {Petr A. Golovach and
Christian Komusiewicz and
Dieter Kratsch and
Van Bang Le},
title = {Refined Notions of Parameterized Enumeration Kernels with Applications
to Matching Cut Enumeration},
journal = {CoRR},
volume = {abs/2101.03800},
year = {2021},
url = {https://arxiv.org/abs/2101.03800},
eprinttype = {arXiv},
eprint = {2101.03800},
timestamp = {Thu, 21 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2101-03800.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2107-06399,
author = {Van Bang Le and
Jan Arne Telle},
title = {The Perfect Matching Cut Problem Revisited},
journal = {CoRR},
volume = {abs/2107.06399},
year = {2021},
url = {https://arxiv.org/abs/2107.06399},
eprinttype = {arXiv},
eprint = {2107.06399},
timestamp = {Wed, 21 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2107-06399.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/LeP20,
author = {Van Bang Le and
Florian Pfender},
title = {Color-line and proper color-line graphs},
journal = {Discret. Appl. Math.},
volume = {278},
pages = {73--82},
year = {2020},
url = {https://doi.org/10.1016/j.dam.2019.06.002},
doi = {10.1016/J.DAM.2019.06.002},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/LeP20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/KomusiewiczKL20,
author = {Christian Komusiewicz and
Dieter Kratsch and
Van Bang Le},
title = {Matching cut: Kernelization, single-exponential time FPT, and exact
exponential algorithms},
journal = {Discret. Appl. Math.},
volume = {283},
pages = {44--58},
year = {2020},
url = {https://doi.org/10.1016/j.dam.2019.12.010},
doi = {10.1016/J.DAM.2019.12.010},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/KomusiewiczKL20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/LeL19,
author = {Ho{\`{a}}ng{-}Oanh Le and
Van Bang Le},
title = {Hardness and Structural Results for Half-Squares of Restricted Tree
Convex Bipartite Graphs},
journal = {Algorithmica},
volume = {81},
number = {11-12},
pages = {4258--4274},
year = {2019},
url = {https://doi.org/10.1007/s00453-018-0440-7},
doi = {10.1007/S00453-018-0440-7},
timestamp = {Thu, 07 Nov 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/LeL19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/LeL19,
author = {Ho{\`{a}}ng{-}Oanh Le and
Van Bang Le},
title = {A complexity dichotomy for matching cut in (bipartite) graphs of fixed
diameter},
journal = {Theor. Comput. Sci.},
volume = {770},
pages = {69--78},
year = {2019},
url = {https://doi.org/10.1016/j.tcs.2018.10.029},
doi = {10.1016/J.TCS.2018.10.029},
timestamp = {Fri, 31 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/LeL19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/LeL19a,
author = {Ho{\`{a}}ng{-}Oanh Le and
Van Bang Le},
title = {Map graphs having witnesses of large girth},
journal = {Theor. Comput. Sci.},
volume = {772},
pages = {143--148},
year = {2019},
url = {https://doi.org/10.1016/j.tcs.2018.12.010},
doi = {10.1016/J.TCS.2018.12.010},
timestamp = {Fri, 31 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/LeL19a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/HsiehLLP19,
author = {Sun{-}Yuan Hsieh and
Ho{\`{a}}ng{-}Oanh Le and
Van Bang Le and
Sheng{-}Lung Peng},
editor = {Ding{-}Zhu Du and
Zhenhua Duan and
Cong Tian},
title = {Matching Cut in Graphs with Large Minimum Degree},
booktitle = {Computing and Combinatorics - 25th International Conference, {COCOON}
2019, Xi'an, China, July 29-31, 2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11653},
pages = {301--312},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-26176-4\_25},
doi = {10.1007/978-3-030-26176-4\_25},
timestamp = {Wed, 24 Jul 2019 17:02:06 +0200},
biburl = {https://dblp.org/rec/conf/cocoon/HsiehLLP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/LeL19,
author = {Ho{\`{a}}ng{-}Oanh Le and
Van Bang Le},
editor = {Peter Rossmanith and
Pinar Heggernes and
Joost{-}Pieter Katoen},
title = {Constrained Representations of Map Graphs and Half-Squares},
booktitle = {44th International Symposium on Mathematical Foundations of Computer
Science, {MFCS} 2019, August 26-30, 2019, Aachen, Germany},
series = {LIPIcs},
volume = {138},
pages = {13:1--13:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.MFCS.2019.13},
doi = {10.4230/LIPICS.MFCS.2019.13},
timestamp = {Fri, 30 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/LeL19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LeP18,
author = {Van Bang Le and
Sheng{-}Lung Peng},
title = {On the complete width and edge clique cover problems},
journal = {J. Comb. Optim.},
volume = {36},
number = {2},
pages = {532--548},
year = {2018},
url = {https://doi.org/10.1007/s10878-016-0106-9},
doi = {10.1007/S10878-016-0106-9},
timestamp = {Tue, 26 Jun 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/LeP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/KomusiewiczKL18,
author = {Christian Komusiewicz and
Dieter Kratsch and
Van Bang Le},
editor = {Christophe Paul and
Michal Pilipczuk},
title = {Matching Cut: Kernelization, Single-Exponential Time FPT, and Exact
Exponential Algorithms},
booktitle = {13th International Symposium on Parameterized and Exact Computation,
{IPEC} 2018, August 20-24, 2018, Helsinki, Finland},
series = {LIPIcs},
volume = {115},
pages = {19:1--19:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.IPEC.2018.19},
doi = {10.4230/LIPICS.IPEC.2018.19},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/iwpec/KomusiewiczKL18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1804-05793,
author = {Ho{\`{a}}ng{-}Oanh Le and
Van Bang Le},
title = {Hardness and structural results for half-squares of restricted tree
convex bipartite graphs},
journal = {CoRR},
volume = {abs/1804.05793},
year = {2018},
url = {http://arxiv.org/abs/1804.05793},
eprinttype = {arXiv},
eprint = {1804.05793},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1804-05793.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1804-11102,
author = {Ho{\`{a}}ng{-}Oanh Le and
Van Bang Le},
title = {A complexity dichotomy for Matching Cut in (bipartite) graphs of fixed
diameter},
journal = {CoRR},
volume = {abs/1804.11102},
year = {2018},
url = {http://arxiv.org/abs/1804.11102},
eprinttype = {arXiv},
eprint = {1804.11102},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1804-11102.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1812-04102,
author = {Ho{\`{a}}ng{-}Oanh Le and
Van Bang Le},
title = {Map graphs having witnesses of large girth},
journal = {CoRR},
volume = {abs/1812.04102},
year = {2018},
url = {http://arxiv.org/abs/1812.04102},
eprinttype = {arXiv},
eprint = {1812.04102},
timestamp = {Tue, 01 Jan 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1812-04102.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/DraganKL17,
author = {Feodor F. Dragan and
Dieter Kratsch and
Van Bang Le},
title = {Preface: Special graph classes and algorithms-in honor of Professor
Andreas Brandst{\"{a}}dt on the occasion of his 65th birthday},
journal = {Discret. Appl. Math.},
volume = {216},
pages = {1},
year = {2017},
url = {https://doi.org/10.1016/j.dam.2016.08.009},
doi = {10.1016/J.DAM.2016.08.009},
timestamp = {Sun, 22 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/DraganKL17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/LeP17,
author = {Van Bang Le and
Thomas Podelleck},
title = {Characterization and recognition of some opposition and coalition
graph classes},
journal = {Discret. Appl. Math.},
volume = {216},
pages = {261--272},
year = {2017},
url = {https://doi.org/10.1016/j.dam.2015.06.007},
doi = {10.1016/J.DAM.2015.06.007},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/LeP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/LeP17a,
author = {Van Bang Le and
Sheng{-}Lung Peng},
title = {Good characterizations and linear time recognition for 2-probe block
graphs},
journal = {Discret. Appl. Math.},
volume = {231},
pages = {181--189},
year = {2017},
url = {https://doi.org/10.1016/j.dam.2016.11.015},
doi = {10.1016/J.DAM.2016.11.015},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/LeP17a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/LeL17,
author = {Ho{\`{a}}ng{-}Oanh Le and
Van Bang Le},
editor = {Yixin Cao and
Jianer Chen},
title = {Hardness and Structural Results for Half-Squares of Restricted Tree
Convex Bipartite Graphs},
booktitle = {Computing and Combinatorics - 23rd International Conference, {COCOON}
2017, Hong Kong, China, August 3-5, 2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10392},
pages = {359--370},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-62389-4\_30},
doi = {10.1007/978-3-319-62389-4\_30},
timestamp = {Tue, 14 May 2019 10:00:35 +0200},
biburl = {https://dblp.org/rec/conf/cocoon/LeL17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KratschL16,
author = {Dieter Kratsch and
Van Bang Le},
title = {Algorithms solving the Matching Cut problem},
journal = {Theor. Comput. Sci.},
volume = {609},
pages = {328--335},
year = {2016},
url = {https://doi.org/10.1016/j.tcs.2015.10.016},
doi = {10.1016/J.TCS.2015.10.016},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/KratschL16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/LeOS16,
author = {Van Bang Le and
Andrea Oversberg and
Oliver Schaudt},
title = {A unified approach to recognize squares of split graphs},
journal = {Theor. Comput. Sci.},
volume = {648},
pages = {26--33},
year = {2016},
url = {https://doi.org/10.1016/j.tcs.2016.07.037},
doi = {10.1016/J.TCS.2016.07.037},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/LeOS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/LeL16,
author = {Ho{\`{a}}ng{-}Oanh Le and
Van Bang Le},
editor = {Seok{-}Hee Hong},
title = {On the Complexity of Matching Cut in Graphs of Fixed Diameter},
booktitle = {27th International Symposium on Algorithms and Computation, {ISAAC}
2016, December 12-14, 2016, Sydney, Australia},
series = {LIPIcs},
volume = {64},
pages = {50:1--50:12},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2016.50},
doi = {10.4230/LIPICS.ISAAC.2016.50},
timestamp = {Thu, 27 Apr 2023 14:57:19 +0200},
biburl = {https://dblp.org/rec/conf/isaac/LeL16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/LeP16,
author = {Van Bang Le and
Sheng{-}Lung Peng},
title = {Good characterizations and linear time recognition for 2-probe block
graphs},
journal = {CoRR},
volume = {abs/1611.06285},
year = {2016},
url = {http://arxiv.org/abs/1611.06285},
eprinttype = {arXiv},
eprint = {1611.06285},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/LeP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/LeP16a,
author = {Van Bang Le and
Sheng{-}Lung Peng},
title = {On the complete width and edge clique cover problems},
journal = {CoRR},
volume = {abs/1612.08057},
year = {2016},
url = {http://arxiv.org/abs/1612.08057},
eprinttype = {arXiv},
eprint = {1612.08057},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/LeP16a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/JoosLR15,
author = {Felix Joos and
Van Bang Le and
Dieter Rautenbach},
title = {Forests and trees among Gallai graphs},
journal = {Discret. Math.},
volume = {338},
number = {2},
pages = {190--195},
year = {2015},
url = {https://doi.org/10.1016/j.disc.2014.09.003},
doi = {10.1016/J.DISC.2014.09.003},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/JoosLR15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/LeP15,
author = {Van Bang Le and
Sheng{-}Lung Peng},
title = {Characterizing and recognizing probe block graphs},
journal = {Theor. Comput. Sci.},
volume = {568},
pages = {97--102},
year = {2015},
url = {https://doi.org/10.1016/j.tcs.2014.12.014},
doi = {10.1016/J.TCS.2014.12.014},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/LeP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/LeOS15,
author = {Van Bang Le and
Andrea Oversberg and
Oliver Schaudt},
title = {Polynomial time recognition of squares of Ptolemaic graphs and 3-sun-free
split graphs},
journal = {Theor. Comput. Sci.},
volume = {602},
pages = {39--49},
year = {2015},
url = {https://doi.org/10.1016/j.tcs.2015.07.060},
doi = {10.1016/J.TCS.2015.07.060},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/LeOS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/KratschL15,
author = {Dieter Kratsch and
Van Bang Le},
editor = {Vangelis Th. Paschos and
Peter Widmayer},
title = {Algorithms Solving the Matching Cut Problem},
booktitle = {Algorithms and Complexity - 9th International Conference, {CIAC} 2015,
Paris, France, May 20-22, 2015. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9079},
pages = {288--299},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-18173-8\_21},
doi = {10.1007/978-3-319-18173-8\_21},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/ciac/KratschL15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/LeP15,
author = {Van Bang Le and
Sheng{-}Lung Peng},
editor = {Dachuan Xu and
Donglei Du and
Ding{-}Zhu Du},
title = {On the Complete Width and Edge Clique Cover Problems},
booktitle = {Computing and Combinatorics - 21st International Conference, {COCOON}
2015, Beijing, China, August 4-6, 2015, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9198},
pages = {537--547},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-21398-9\_42},
doi = {10.1007/978-3-319-21398-9\_42},
timestamp = {Sun, 25 Oct 2020 22:58:52 +0100},
biburl = {https://dblp.org/rec/conf/cocoon/LeP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/LeP15,
author = {Van Bang Le and
Thomas Podelleck},
title = {Characterization and recognition of some opposition and coalition
graph classes},
journal = {CoRR},
volume = {abs/1507.00557},
year = {2015},
url = {http://arxiv.org/abs/1507.00557},
eprinttype = {arXiv},
eprint = {1507.00557},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/LeP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/LeP15a,
author = {Van Bang Le and
Florian Pfender},
title = {Color-line and Proper Color-line Graphs},
journal = {CoRR},
volume = {abs/1511.01025},
year = {2015},
url = {http://arxiv.org/abs/1511.01025},
eprinttype = {arXiv},
eprint = {1511.01025},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/LeP15a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BrandstadtEGLLP14,
author = {Andreas Brandst{\"{a}}dt and
Konrad Engel and
Hans{-}Dietrich O. F. Gronau and
Roger Labahn and
Van Bang Le and
Florian Pfender},
title = {Preface},
journal = {Discret. Appl. Math.},
volume = {163},
pages = {101},
year = {2014},
url = {https://doi.org/10.1016/j.dam.2013.09.002},
doi = {10.1016/J.DAM.2013.09.002},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/BrandstadtEGLLP14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Le14,
author = {Van Bang Le},
title = {On opposition graphs, coalition graphs, and bipartite permutation
graphs},
journal = {Discret. Appl. Math.},
volume = {168},
pages = {26--33},
year = {2014},
url = {https://doi.org/10.1016/j.dam.2012.11.020},
doi = {10.1016/J.DAM.2012.11.020},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Le14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BrandstadtL14,
author = {Andreas Brandst{\"{a}}dt and
Van Bang Le},
title = {A note on efficient domination in a superclass of P\({}_{\mbox{5}}\)-free
graphs},
journal = {Inf. Process. Lett.},
volume = {114},
number = {7},
pages = {357--359},
year = {2014},
url = {https://doi.org/10.1016/j.ipl.2014.02.007},
doi = {10.1016/J.IPL.2014.02.007},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BrandstadtL14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/LeP14,
author = {Van Bang Le and
Florian Pfender},
title = {Complexity results for rainbow matchings},
journal = {Theor. Comput. Sci.},
volume = {524},
pages = {27--33},
year = {2014},
url = {https://doi.org/10.1016/j.tcs.2013.12.013},
doi = {10.1016/J.TCS.2013.12.013},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/LeP14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/LeN14,
author = {Van Bang Le and
Ragnar Nevries},
title = {Complexity and algorithms for recognizing polar and monopolar graphs},
journal = {Theor. Comput. Sci.},
volume = {528},
pages = {1--11},
year = {2014},
url = {https://doi.org/10.1016/j.tcs.2014.01.032},
doi = {10.1016/J.TCS.2014.01.032},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/LeN14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/intcompsymp/LeP14,
author = {Van Bang Le and
Sheng{-}Lung Peng},
editor = {William Cheng{-}Chung Chu and
Han{-}Chieh Chao and
Stephen Jenn{-}Hwa Yang},
title = {Good characterizations and linear time recognition for 2-probe block
graphs},
booktitle = {Intelligent Systems and Applications - Proceedings of the International
Computer Symposium {(ICS)} held at Taichung, Taiwan, December 12-14,
2014},
series = {Frontiers in Artificial Intelligence and Applications},
volume = {274},
pages = {22--31},
publisher = {{IOS} Press},
year = {2014},
url = {https://doi.org/10.3233/978-1-61499-484-8-22},
doi = {10.3233/978-1-61499-484-8-22},
timestamp = {Sun, 21 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/intcompsymp/LeP14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/LeOS14,
author = {Van Bang Le and
Andrea Oversberg and
Oliver Schaudt},
editor = {Dieter Kratsch and
Ioan Todinca},
title = {Polynomial Time Recognition of Squares of Ptolemaic Graphs and 3-sun-free
Split Graphs},
booktitle = {Graph-Theoretic Concepts in Computer Science - 40th International
Workshop, {WG} 2014, Nouan-le-Fuzelier, France, June 25-27, 2014.
Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {8747},
pages = {360--371},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-12340-0\_30},
doi = {10.1007/978-3-319-12340-0\_30},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/LeOS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/LeOS14,
author = {Van Bang Le and
Andrea Oversberg and
Oliver Schaudt},
title = {Polynomial time recognition of squares of ptolemaic graphs and 3-sun-free
split graphs},
journal = {CoRR},
volume = {abs/1402.0024},
year = {2014},
url = {http://arxiv.org/abs/1402.0024},
eprinttype = {arXiv},
eprint = {1402.0024},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/LeOS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/LeOS14a,
author = {Van Bang Le and
Andrea Oversberg and
Oliver Schaudt},
title = {Squares of {\textdollar}3{\textdollar}-sun-free split graphs},
journal = {CoRR},
volume = {abs/1410.2075},
year = {2014},
url = {http://arxiv.org/abs/1410.2075},
eprinttype = {arXiv},
eprint = {1410.2075},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/LeOS14a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/LeP13,
author = {Van Bang Le and
Florian Pfender},
title = {Extremal Graphs Having No Stable Cutset},
journal = {Electron. J. Comb.},
volume = {20},
number = {1},
pages = {35},
year = {2013},
url = {https://doi.org/10.37236/2513},
doi = {10.37236/2513},
timestamp = {Fri, 10 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/LeP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/LeR13,
author = {Van Bang Le and
Dieter Rautenbach},
title = {Integral mixed unit interval graphs},
journal = {Discret. Appl. Math.},
volume = {161},
number = {7-8},
pages = {1028--1036},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.09.013},
doi = {10.1016/J.DAM.2012.09.013},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/LeR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/LeP13,
author = {Van Bang Le and
Florian Pfender},
title = {Complexity Results for Rainbow Matchings},
journal = {CoRR},
volume = {abs/1312.7253},
year = {2013},
url = {http://arxiv.org/abs/1312.7253},
eprinttype = {arXiv},
eprint = {1312.7253},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/LeP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FarzadLLT12,
author = {Babak Farzad and
Lap Chi Lau and
Van Bang Le and
Nguyen Ngoc Tuy},
title = {Complexity of Finding Graph Roots with Girth Conditions},
journal = {Algorithmica},
volume = {62},
number = {1-2},
pages = {38--53},
year = {2012},
url = {https://doi.org/10.1007/s00453-010-9442-9},
doi = {10.1007/S00453-010-9442-9},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/FarzadLLT12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/DouradoLPRS12,
author = {Mitre Costa Dourado and
Van Bang Le and
F{\'{a}}bio Protti and
Dieter Rautenbach and
Jayme Luiz Szwarcfiter},
title = {Mixed unit interval graphs},
journal = {Discret. Math.},
volume = {312},
number = {22},
pages = {3357--3363},
year = {2012},
url = {https://doi.org/10.1016/j.disc.2012.07.037},
doi = {10.1016/J.DISC.2012.07.037},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/DouradoLPRS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/LeR12,
author = {Van Bang Le and
Dieter Rautenbach},
editor = {Joachim Gudmundsson and
Juli{\'{a}}n Mestre and
Taso Viglas},
title = {Integral Mixed Unit Interval Graphs},
booktitle = {Computing and Combinatorics - 18th Annual International Conference,
{COCOON} 2012, Sydney, Australia, August 20-22, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7434},
pages = {495--506},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-32241-9\_42},
doi = {10.1007/978-3-642-32241-9\_42},
timestamp = {Tue, 14 May 2019 10:00:35 +0200},
biburl = {https://dblp.org/rec/conf/cocoon/LeR12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/anor/Le11,
author = {Van Bang Le},
title = {Two characterizations of chain partitioned probe graphs},
journal = {Ann. Oper. Res.},
volume = {188},
number = {1},
pages = {279--283},
year = {2011},
url = {https://doi.org/10.1007/s10479-010-0749-3},
doi = {10.1007/S10479-010-0749-3},
timestamp = {Thu, 13 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/anor/Le11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/BrandstadtGLL11,
author = {Andreas Brandst{\"{a}}dt and
Martin Charles Golumbic and
Van Bang Le and
Marina Lipshteyn},
title = {Path-Bicolorable Graphs},
journal = {Graphs Comb.},
volume = {27},
number = {6},
pages = {799--819},
year = {2011},
url = {https://doi.org/10.1007/s00373-010-1007-9},
doi = {10.1007/S00373-010-1007-9},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/BrandstadtGLL11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LeT11,
author = {Van Bang Le and
Nguyen Ngoc Tuy},
title = {A good characterization of squares of strongly chordal split graphs},
journal = {Inf. Process. Lett.},
volume = {111},
number = {3},
pages = {120--123},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2010.11.003},
doi = {10.1016/J.IPL.2010.11.003},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LeT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/LeN11,
author = {Van Bang Le and
Ragnar Nevries},
editor = {Takao Asano and
Shin{-}Ichi Nakano and
Yoshio Okamoto and
Osamu Watanabe},
title = {Recognizing Polar Planar Graphs Using New Results for Monopolarity},
booktitle = {Algorithms and Computation - 22nd International Symposium, {ISAAC}
2011, Yokohama, Japan, December 5-8, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7074},
pages = {120--129},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-25591-5\_14},
doi = {10.1007/978-3-642-25591-5\_14},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/isaac/LeN11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/LeT10,
author = {Van Bang Le and
Nguyen Ngoc Tuy},
title = {The square of a block graph},
journal = {Discret. Math.},
volume = {310},
number = {4},
pages = {734--741},
year = {2010},
url = {https://doi.org/10.1016/j.disc.2009.09.004},
doi = {10.1016/J.DISC.2009.09.004},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/LeT10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BrandstadtLR10,
author = {Andreas Brandst{\"{a}}dt and
Van Bang Le and
Dieter Rautenbach},
title = {Exact leaf powers},
journal = {Theor. Comput. Sci.},
volume = {411},
number = {31-33},
pages = {2968--2977},
year = {2010},
url = {https://doi.org/10.1016/j.tcs.2010.04.027},
doi = {10.1016/J.TCS.2010.04.027},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BrandstadtLR10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BrandstadtEGL09,
author = {Andreas Brandst{\"{a}}dt and
Konrad Engel and
Hans{-}Dietrich O. F. Gronau and
Van Bang Le},
title = {Preface},
journal = {Discret. Appl. Math.},
volume = {157},
number = {9},
pages = {1979},
year = {2009},
url = {https://doi.org/10.1016/j.dam.2008.11.007},
doi = {10.1016/J.DAM.2008.11.007},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BrandstadtEGL09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BrandstadtLR09,
author = {Andreas Brandst{\"{a}}dt and
Van Bang Le and
Dieter Rautenbach},
title = {A forbidden induced subgraph characterization of distance-hereditary
5-leaf powers},
journal = {Discret. Math.},
volume = {309},
number = {12},
pages = {3843--3852},
year = {2009},
url = {https://doi.org/10.1016/j.disc.2008.10.025},
doi = {10.1016/J.DISC.2008.10.025},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/BrandstadtLR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BayerLR09,
author = {Daniel Bayer and
Van Bang Le and
H. N. de Ridder},
title = {Probe threshold and probe trivially perfect graphs},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {47-49},
pages = {4812--4822},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.06.029},
doi = {10.1016/J.TCS.2009.06.029},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BayerLR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BrandstadtL09,
author = {Andreas Brandst{\"{a}}dt and
Van Bang Le},
title = {Simplicial powers of graphs},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {52},
pages = {5443--5454},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.04.010},
doi = {10.1016/J.TCS.2009.04.010},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BrandstadtL09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/birthday/BrandstadtGLL09,
author = {Andreas Brandst{\"{a}}dt and
Martin Charles Golumbic and
Van Bang Le and
Marina Lipshteyn},
editor = {Marina Lipshteyn and
Vadim E. Levit and
Ross M. McConnell},
title = {Path-Bicolorable Graphs},
booktitle = {Graph Theory, Computational Intelligence and Thought, Essays Dedicated
to Martin Charles Golumbic on the Occasion of His 60th Birthday},
series = {Lecture Notes in Computer Science},
volume = {5420},
pages = {172--182},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-02029-2\_17},
doi = {10.1007/978-3-642-02029-2\_17},
timestamp = {Tue, 14 May 2019 10:00:52 +0200},
biburl = {https://dblp.org/rec/conf/birthday/BrandstadtGLL09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/FarzadLLT09,
author = {Babak Farzad and
Lap Chi Lau and
Van Bang Le and
Nguyen Ngoc Tuy},
editor = {Susanne Albers and
Jean{-}Yves Marion},
title = {Computing Graph Roots Without Short Cycles},
booktitle = {26th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2009, February 26-28, 2009, Freiburg, Germany, Proceedings},
series = {LIPIcs},
volume = {3},
pages = {397--408},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, Germany},
year = {2009},
url = {https://doi.org/10.4230/LIPIcs.STACS.2009.1827},
doi = {10.4230/LIPICS.STACS.2009.1827},
timestamp = {Tue, 22 Jun 2021 15:43:57 +0200},
biburl = {https://dblp.org/rec/conf/stacs/FarzadLLT09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/LeT09,
author = {Van Bang Le and
Nguyen Ngoc Tuy},
editor = {Christophe Paul and
Michel Habib},
title = {Hardness Results and Efficient Algorithms for Graph Powers},
booktitle = {Graph-Theoretic Concepts in Computer Science, 35th International Workshop,
{WG} 2009, Montpellier, France, June 24-26, 2009. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {5911},
pages = {238--249},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-11409-0\_21},
doi = {10.1007/978-3-642-11409-0\_21},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/LeT09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0902-2150,
author = {Babak Farzad and
Lap Chi Lau and
Van Bang Le and
Nguyen Ngoc Tuy},
title = {Computing Graph Roots Without Short Cycles},
journal = {CoRR},
volume = {abs/0902.2150},
year = {2009},
url = {http://arxiv.org/abs/0902.2150},
eprinttype = {arXiv},
eprint = {0902.2150},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0902-2150.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/LeMM08,
author = {Van Bang Le and
Raffaele Mosca and
Haiko M{\"{u}}ller},
title = {On stable cutsets in claw-free graphs and planar graphs},
journal = {J. Discrete Algorithms},
volume = {6},
number = {2},
pages = {256--276},
year = {2008},
url = {https://doi.org/10.1016/j.jda.2007.04.001},
doi = {10.1016/J.JDA.2007.04.001},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/LeMM08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BrandstadtLS08,
author = {Andreas Brandst{\"{a}}dt and
Van Bang Le and
R. Sritharan},
title = {Structure and linear-time recognition of 4-leaf powers},
journal = {{ACM} Trans. Algorithms},
volume = {5},
number = {1},
pages = {11:1--11:22},
year = {2008},
url = {https://doi.org/10.1145/1435375.1435386},
doi = {10.1145/1435375.1435386},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/BrandstadtLS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoa/BrandstadtL08,
author = {Andreas Brandst{\"{a}}dt and
Van Bang Le},
editor = {Boting Yang and
Ding{-}Zhu Du and
Cao An Wang},
title = {Simplicial Powers of Graphs},
booktitle = {Combinatorial Optimization and Applications, Second International
Conference, {COCOA} 2008, St. John's, NL, Canada, August 21-24, 2008.
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5165},
pages = {160--170},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-85097-7\_15},
doi = {10.1007/978-3-540-85097-7\_15},
timestamp = {Tue, 14 May 2019 10:00:52 +0200},
biburl = {https://dblp.org/rec/conf/cocoa/BrandstadtL08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/ChandlerCKLP08,
author = {David B. Chandler and
Maw{-}Shang Chang and
Ton Kloks and
Van Bang Le and
Sheng{-}Lung Peng},
editor = {Xiaodong Hu and
Jie Wang},
title = {Probe Ptolemaic Graphs},
booktitle = {Computing and Combinatorics, 14th Annual International Conference,
{COCOON} 2008, Dalian, China, June 27-29, 2008, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5092},
pages = {468--477},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-69733-6\_46},
doi = {10.1007/978-3-540-69733-6\_46},
timestamp = {Tue, 10 Dec 2019 14:59:33 +0100},
biburl = {https://dblp.org/rec/conf/cocoon/ChandlerCKLP08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BrandstadtDLLU07,
author = {Andreas Brandst{\"{a}}dt and
Feodor F. Dragan and
Ho{\`{a}}ng{-}Oanh Le and
Van Bang Le and
Ryuhei Uehara},
title = {Tree Spanners for Bipartite Graphs and Probe Interval Graphs},
journal = {Algorithmica},
volume = {47},
number = {1},
pages = {27--51},
year = {2007},
url = {https://doi.org/10.1007/s00453-006-1209-y},
doi = {10.1007/S00453-006-1209-Y},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BrandstadtDLLU07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmtcs/LeR07,
author = {Van Bang Le and
H. N. de Ridder},
title = {Probe Split Graphs},
journal = {Discret. Math. Theor. Comput. Sci.},
volume = {9},
number = {1},
year = {2007},
url = {https://doi.org/10.46298/dmtcs.401},
doi = {10.46298/DMTCS.401},
timestamp = {Tue, 24 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dmtcs/LeR07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BrandstadtLM07,
author = {Andreas Brandst{\"{a}}dt and
Van Bang Le and
Suhail Mahfud},
title = {New applications of clique separator decomposition for the Maximum
Weight Stable Set problem},
journal = {Theor. Comput. Sci.},
volume = {370},
number = {1-3},
pages = {229--239},
year = {2007},
url = {https://doi.org/10.1016/j.tcs.2006.10.035},
doi = {10.1016/J.TCS.2006.10.035},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BrandstadtLM07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/LeRS07,
author = {Van Bang Le and
Bert Randerath and
Ingo Schiermeyer},
title = {On the complexity of 4-coloring graphs without long induced paths},
journal = {Theor. Comput. Sci.},
volume = {389},
number = {1-2},
pages = {330--335},
year = {2007},
url = {https://doi.org/10.1016/j.tcs.2007.09.009},
doi = {10.1016/J.TCS.2007.09.009},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/LeRS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/LeR07,
author = {Van Bang Le and
H. N. de Ridder},
editor = {Andreas Brandst{\"{a}}dt and
Dieter Kratsch and
Haiko M{\"{u}}ller},
title = {Characterisations and Linear-Time Recognition of Probe Cographs},
booktitle = {Graph-Theoretic Concepts in Computer Science, 33rd International Workshop,
{WG} 2007, Dornburg, Germany, June 21-23, 2007. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {4769},
pages = {226--237},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-74839-7\_22},
doi = {10.1007/978-3-540-74839-7\_22},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/LeR07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/LeR07,
author = {Van Bang Le and
H. N. de Ridder},
editor = {Andreas Brandst{\"{a}}dt and
Klaus Jansen and
Dieter Kratsch and
Jeremy P. Spinrad},
title = {Linear-time certifying recognition for partitioned probe cographs},
booktitle = {Exact, Approximative, Robust and Certifying Algorithms on Particular
Graph Classes, 20.05. - 25.05.2007},
series = {Dagstuhl Seminar Proceedings},
volume = {07211},
publisher = {Internationales Begegnungs- und Forschungszentrum fuer Informatik
(IBFI), Schloss Dagstuhl, Germany},
year = {2007},
url = {http://drops.dagstuhl.de/opus/volltexte/2007/1270},
timestamp = {Thu, 10 Jun 2021 13:02:07 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/LeR07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/RidderLB06,
author = {H. N. de Ridder and
Van Bang Le and
Daniel Bayer},
title = {On probe classes of graphs},
journal = {Electron. Notes Discret. Math.},
volume = {27},
pages = {21},
year = {2006},
url = {https://doi.org/10.1016/j.endm.2006.08.037},
doi = {10.1016/J.ENDM.2006.08.037},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/RidderLB06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/TuyBL06,
author = {Nguyen Ngoc Tuy and
J{\"{o}}rg Bornemann and
Van Bang Le},
title = {Graph classes related to chordal graphs and chordal bipartite graphs},
journal = {Electron. Notes Discret. Math.},
volume = {27},
pages = {73--74},
year = {2006},
url = {https://doi.org/10.1016/j.endm.2006.08.062},
doi = {10.1016/J.ENDM.2006.08.062},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/TuyBL06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/RautenbachBL06,
author = {Dieter Rautenbach and
Andreas Brandst{\"{a}}dt and
Van Bang Le},
title = {Distance-Hereditary 5-Leaf Powers},
journal = {Electron. Notes Discret. Math.},
volume = {27},
pages = {85--86},
year = {2006},
url = {https://doi.org/10.1016/j.endm.2006.08.068},
doi = {10.1016/J.ENDM.2006.08.068},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/RautenbachBL06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BrandstadtL06,
author = {Andreas Brandst{\"{a}}dt and
Van Bang Le},
title = {Structure and linear time recognition of 3-leaf powers},
journal = {Inf. Process. Lett.},
volume = {98},
number = {4},
pages = {133--138},
year = {2006},
url = {https://doi.org/10.1016/j.ipl.2006.01.004},
doi = {10.1016/J.IPL.2006.01.004},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BrandstadtL06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BrandstadtHLL05,
author = {Andreas Brandst{\"{a}}dt and
Peter L. Hammer and
Van Bang Le and
Vadim V. Lozin},
title = {Bisplit graphs},
journal = {Discret. Math.},
volume = {299},
number = {1-3},
pages = {11--32},
year = {2005},
url = {https://doi.org/10.1016/j.disc.2004.08.046},
doi = {10.1016/J.DISC.2004.08.046},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/BrandstadtHLL05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fct/BrandstadtLM05,
author = {Andreas Brandst{\"{a}}dt and
Van Bang Le and
Suhail Mahfud},
editor = {Maciej Liskiewicz and
R{\"{u}}diger Reischuk},
title = {New Applications of Clique Separator Decomposition for the Maximum
Weight Stable Set Problem},
booktitle = {Fundamentals of Computation Theory, 15th International Symposium,
{FCT} 2005, L{\"{u}}beck, Germany, August 17-20, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3623},
pages = {516--527},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11537311\_45},
doi = {10.1007/11537311\_45},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/fct/BrandstadtLM05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/LeMM05,
author = {Van Bang Le and
Raffaele Mosca and
Haiko M{\"{u}}ller},
editor = {Dieter Kratsch},
title = {On Stable Cutsets in Claw-Free Graphs and Planar Graphs},
booktitle = {Graph-Theoretic Concepts in Computer Science, 31st International Workshop,
{WG} 2005, Metz, France, June 23-25, 2005, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {3787},
pages = {163--174},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11604686\_15},
doi = {10.1007/11604686\_15},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/wg/LeMM05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/LeS04,
author = {Van Bang Le and
Jeremy P. Spinrad},
title = {Consequences of an algorithm for bridged graphs},
journal = {Discret. Math.},
volume = {280},
number = {1-3},
pages = {271--274},
year = {2004},
url = {https://doi.org/10.1016/j.disc.2002.05.001},
doi = {10.1016/J.DISC.2002.05.001},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/LeS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BrandstadtLR04,
author = {Andreas Brandst{\"{a}}dt and
Van Bang Le and
H. N. de Ridder},
title = {Efficient robust algorithms for the Maximum Weight Stable Set Problem
in chair-free graph classes},
journal = {Inf. Process. Lett.},
volume = {89},
number = {4},
pages = {165--173},
year = {2004},
url = {https://doi.org/10.1016/j.ipl.2003.11.002},
doi = {10.1016/J.IPL.2003.11.002},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BrandstadtLR04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/BrandstadtL04,
author = {Andreas Brandst{\"{a}}dt and
Van Bang Le},
title = {Split-Perfect Graphs: Characterizations and Algorithmic Use},
journal = {{SIAM} J. Discret. Math.},
volume = {17},
number = {3},
pages = {341--360},
year = {2004},
url = {https://doi.org/10.1137/S0895480100367676},
doi = {10.1137/S0895480100367676},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/BrandstadtL04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BrandstadtDLL04,
author = {Andreas Brandst{\"{a}}dt and
Feodor F. Dragan and
Ho{\`{a}}ng{-}Oanh Le and
Van Bang Le},
title = {Tree spanners on chordal graphs: complexity and algorithms},
journal = {Theor. Comput. Sci.},
volume = {310},
number = {1-3},
pages = {329--354},
year = {2004},
url = {https://doi.org/10.1016/S0304-3975(03)00424-9},
doi = {10.1016/S0304-3975(03)00424-9},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BrandstadtDLL04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Le03,
author = {Van Bang Le},
title = {Bipartite-perfect Graphs},
journal = {Discret. Appl. Math.},
volume = {127},
number = {3},
pages = {581--599},
year = {2003},
url = {https://doi.org/10.1016/S0166-218X(02)00390-6},
doi = {10.1016/S0166-218X(02)00390-6},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Le03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BrandstadtHL03,
author = {Andreas Brandst{\"{a}}dt and
Ch{\'{\i}}nh T. Ho{\`{a}}ng and
Van Bang Le},
title = {Stability number of bull- and chair-free graphs revisited},
journal = {Discret. Appl. Math.},
volume = {131},
number = {1},
pages = {39--50},
year = {2003},
url = {https://doi.org/10.1016/S0166-218X(02)00415-8},
doi = {10.1016/S0166-218X(02)00415-8},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BrandstadtHL03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/LeLM03,
author = {Ho{\`{a}}ng{-}Oanh Le and
Van Bang Le and
Haiko M{\"{u}}ller},
title = {Splitting a graph into disjoint induced paths or cycles},
journal = {Discret. Appl. Math.},
volume = {131},
number = {1},
pages = {199--212},
year = {2003},
url = {https://doi.org/10.1016/S0166-218X(02)00425-0},
doi = {10.1016/S0166-218X(02)00425-0},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/LeLM03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/Fiala03,
author = {Jir{\'{\i}} Fiala and
Klaus Jansen and
Van Bang Le and
Eike Seidel},
title = {Graph Subcolorings: Complexity and Algorithms},
journal = {{SIAM} J. Discret. Math.},
volume = {16},
number = {4},
pages = {635--650},
year = {2003},
url = {https://doi.org/10.1137/S0895480101395245},
doi = {10.1137/S0895480101395245},
timestamp = {Sat, 31 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/Fiala03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/LeR03,
author = {Van Bang Le and
Bert Randerath},
title = {On stable cutsets in line graphs},
journal = {Theor. Comput. Sci.},
volume = {301},
number = {1-3},
pages = {463--475},
year = {2003},
url = {https://doi.org/10.1016/S0304-3975(03)00048-3},
doi = {10.1016/S0304-3975(03)00048-3},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/LeR03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/BrandstadtDLLU03,
author = {Andreas Brandst{\"{a}}dt and
Feodor F. Dragan and
Ho{\`{a}}ng{-}Oanh Le and
Van Bang Le and
Ryuhei Uehara},
editor = {Hans L. Bodlaender},
title = {Tree Spanners for Bipartite Graphs and Probe Interval Graphs},
booktitle = {Graph-Theoretic Concepts in Computer Science, 29th International Workshop,
{WG} 2003, Elspeet, The Netherlands, June 19-21, 2003, Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {2880},
pages = {106--118},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/978-3-540-39890-5\_10},
doi = {10.1007/978-3-540-39890-5\_10},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/wg/BrandstadtDLLU03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmtcs/BabelBL02,
author = {Luitpold Babel and
Andreas Brandst{\"{a}}dt and
Van Bang Le},
title = {Recognizing the P\({}_{\mbox{4}}\)-structure of claw-free graphs and
a larger graph class},
journal = {Discret. Math. Theor. Comput. Sci.},
volume = {5},
number = {1},
pages = {127--146},
year = {2002},
url = {https://doi.org/10.46298/dmtcs.294},
doi = {10.46298/DMTCS.294},
timestamp = {Tue, 24 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dmtcs/BabelBL02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LeL02,
author = {Ho{\`{a}}ng{-}Oanh Le and
Van Bang Le},
title = {The NP-completeness of (1, r)-subcolorability of cubic graphs},
journal = {Inf. Process. Lett.},
volume = {81},
number = {3},
pages = {157--162},
year = {2002},
url = {https://doi.org/10.1016/S0020-0190(01)00205-8},
doi = {10.1016/S0020-0190(01)00205-8},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LeL02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BrandstadtLL02,
author = {Andreas Brandst{\"{a}}dt and
Ho{\`{a}}ng{-}Oanh Le and
Van Bang Le},
title = {On alpha-redundant vertices in P5-free graphs},
journal = {Inf. Process. Lett.},
volume = {82},
number = {3},
pages = {119--122},
year = {2002},
url = {https://doi.org/10.1016/S0020-0190(01)00265-4},
doi = {10.1016/S0020-0190(01)00265-4},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BrandstadtLL02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/BrandstadtDLL02,
author = {Andreas Brandst{\"{a}}dt and
Feodor F. Dragan and
Ho{\`{a}}ng{-}Oanh Le and
Van Bang Le},
editor = {Prosenjit Bose and
Pat Morin},
title = {Tree Spanners on Chordal Graphs: Complexity, Algorithms, Open Problems},
booktitle = {Algorithms and Computation, 13th International Symposium, {ISAAC}
2002 Vancouver, BC, Canada, November 21-23, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2518},
pages = {163--174},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-36136-7\_15},
doi = {10.1007/3-540-36136-7\_15},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/isaac/BrandstadtDLL02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmtcs/HoangL01,
author = {Ch{\'{\i}}nh T. Ho{\`{a}}ng and
Van Bang Le},
title = {P4-Colorings and P4-Bipartite Graphs},
journal = {Discret. Math. Theor. Comput. Sci.},
volume = {4},
number = {2},
pages = {109--122},
year = {2001},
url = {https://doi.org/10.46298/dmtcs.272},
doi = {10.46298/DMTCS.272},
timestamp = {Tue, 24 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dmtcs/HoangL01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/FialaJLS01,
author = {Jir{\'{\i}} Fiala and
Klaus Jansen and
Van Bang Le and
Eike Seidel},
editor = {Andreas Brandst{\"{a}}dt and
Van Bang Le},
title = {Graph Subcolorings: Complexity and Algorithms},
booktitle = {Graph-Theoretic Concepts in Computer Science, 27th International Workshop,
{WG} 2001, Boltenhagen, Germany, June 14-16, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2204},
pages = {154--165},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-45477-2\_15},
doi = {10.1007/3-540-45477-2\_15},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/FialaJLS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/LeR01,
author = {Van Bang Le and
Bert Randerath},
editor = {Andreas Brandst{\"{a}}dt and
Van Bang Le},
title = {On Stable Cutsets in Line Graphs},
booktitle = {Graph-Theoretic Concepts in Computer Science, 27th International Workshop,
{WG} 2001, Boltenhagen, Germany, June 14-16, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2204},
pages = {263--271},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-45477-2\_24},
doi = {10.1007/3-540-45477-2\_24},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/LeR01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/wg/2001,
editor = {Andreas Brandst{\"{a}}dt and
Van Bang Le},
title = {Graph-Theoretic Concepts in Computer Science, 27th International Workshop,
{WG} 2001, Boltenhagen, Germany, June 14-16, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2204},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-45477-2},
doi = {10.1007/3-540-45477-2},
isbn = {3-540-42707-4},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/2001.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BrandstadtL00,
author = {Andreas Brandst{\"{a}}dt and
Van Bang Le},
title = {Recognizing the P\({}_{\mbox{4}}\)-structure of Block Graphs},
journal = {Discret. Appl. Math.},
volume = {99},
number = {1-3},
pages = {349--366},
year = {2000},
url = {https://doi.org/10.1016/S0166-218X(99)00145-6},
doi = {10.1016/S0166-218X(99)00145-6},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BrandstadtL00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BrandstadtDLS00,
author = {Andreas Brandst{\"{a}}dt and
Feodor F. Dragan and
Van Bang Le and
Thomas Szymczak},
title = {On stable cutsets in graphs},
journal = {Discret. Appl. Math.},
volume = {105},
number = {1-3},
pages = {39--50},
year = {2000},
url = {https://doi.org/10.1016/S0166-218X(00)00197-9},
doi = {10.1016/S0166-218X(00)00197-9},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BrandstadtDLS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/HoangL00,
author = {Ch{\'{\i}}nh T. Ho{\`{a}}ng and
Van Bang Le},
title = {On \emph{P}\({}_{\mbox{4}}\)-transversals of perfect graphs},
journal = {Discret. Math.},
volume = {216},
number = {1-3},
pages = {195--210},
year = {2000},
url = {https://doi.org/10.1016/S0012-365X(99)00300-3},
doi = {10.1016/S0012-365X(99)00300-3},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/HoangL00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmgt/Le00,
author = {Van Bang Le},
title = {Some conjectures on perfect graphs},
journal = {Discuss. Math. Graph Theory},
volume = {20},
number = {1},
pages = {155--159},
year = {2000},
url = {https://doi.org/10.7151/dmgt.1115},
doi = {10.7151/DMGT.1115},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmgt/Le00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/BrandstadtLO00,
author = {Andreas Brandst{\"{a}}dt and
Van Bang Le and
Stephan Olariu},
title = {Efficiently Recognizing the \emph{P} \({}_{\mbox{4}}\)-Structure of
Trees and of Bipartite Graphs Without Short Cycles},
journal = {Graphs Comb.},
volume = {16},
number = {4},
pages = {381--387},
year = {2000},
url = {https://doi.org/10.1007/s003730070002},
doi = {10.1007/S003730070002},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/BrandstadtLO00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/HoangL00,
author = {Ch{\'{\i}}nh T. Ho{\`{a}}ng and
Van Bang Le},
title = {Recognizing Perfect 2-Split Graphs},
journal = {{SIAM} J. Discret. Math.},
volume = {13},
number = {1},
pages = {48--55},
year = {2000},
url = {https://doi.org/10.1137/S0895480197329089},
doi = {10.1137/S0895480197329089},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/HoangL00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/BrandstadtL00,
author = {Andreas Brandst{\"{a}}dt and
Van Bang Le},
editor = {Ulrik Brandes and
Dorothea Wagner},
title = {Split-Perfect Graphs: Characterizations and Algorithmic Use},
booktitle = {Graph-Theoretic Concepts in Computer Science, 26th International Workshop,
{WG} 2000, Konstanz, Germany, June 15-17, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1928},
pages = {71--82},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-40064-8\_8},
doi = {10.1007/3-540-40064-8\_8},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/BrandstadtL00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BabelBL99,
author = {Luitpold Babel and
Andreas Brandst{\"{a}}dt and
Van Bang Le},
title = {Recognizing the P\({}_{\mbox{4}}\)-structure of Bipartite Graphs},
journal = {Discret. Appl. Math.},
volume = {93},
number = {2-3},
pages = {157--168},
year = {1999},
url = {https://doi.org/10.1016/S0166-218X(99)00104-3},
doi = {10.1016/S0166-218X(99)00104-3},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BabelBL99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BrandstadtL99,
author = {Andreas Brandst{\"{a}}dt and
Van Bang Le},
title = {Tree- and Forest-perfect Graphs},
journal = {Discret. Appl. Math.},
volume = {95},
number = {1-3},
pages = {141--162},
year = {1999},
url = {https://doi.org/10.1016/S0166-218X(99)00071-2},
doi = {10.1016/S0166-218X(99)00071-2},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BrandstadtL99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/Le99,
author = {Van Bang Le},
title = {Bipartite-Perfect Graphs},
journal = {Electron. Notes Discret. Math.},
volume = {3},
pages = {7--12},
year = {1999},
url = {https://doi.org/10.1016/S1571-0653(05)80012-5},
doi = {10.1016/S1571-0653(05)80012-5},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/Le99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Le99,
author = {Van Bang Le},
title = {A good characterization of cograph contractions},
journal = {J. Graph Theory},
volume = {30},
number = {4},
pages = {309--318},
year = {1999},
url = {https://doi.org/10.1002/(SICI)1097-0118(199904)30:4\&\#60;309::AID-JGT5\&\#62;3.0.CO;2-5},
doi = {10.1002/(SICI)1097-0118(199904)30:4\&\#60;309::AID-JGT5\&\#62;3.0.CO;2-5},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Le99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/LeL99,
author = {Ho{\`{a}}ng{-}Oanh Le and
Van Bang Le},
title = {Optimal tree 3-spanners in directed path graphs},
journal = {Networks},
volume = {34},
number = {2},
pages = {81--87},
year = {1999},
url = {https://doi.org/10.1002/(SICI)1097-0037(199909)34:2\&\#60;81::AID-NET1\&\#62;3.0.CO;2-P},
doi = {10.1002/(SICI)1097-0037(199909)34:2\&\#60;81::AID-NET1\&\#62;3.0.CO;2-P},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/LeL99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BrandstadtLS98,
author = {Andreas Brandst{\"{a}}dt and
Van Bang Le and
Thomas Szymczak},
title = {The Complexity of some Problems Related to Graph 3-colorability},
journal = {Discret. Appl. Math.},
volume = {89},
number = {1-3},
pages = {59--73},
year = {1998},
url = {https://doi.org/10.1016/S0166-218X(98)00116-4},
doi = {10.1016/S0166-218X(98)00116-4},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BrandstadtLS98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BrandstadtLS97,
author = {Andreas Brandst{\"{a}}dt and
Van Bang Le and
Thomas Szymczak},
title = {Duchet-type theorems for powers of HHD-free graphs},
journal = {Discret. Math.},
volume = {177},
number = {1-3},
pages = {9--16},
year = {1997},
url = {https://doi.org/10.1016/S0012-365X(96)00370-6},
doi = {10.1016/S0012-365X(96)00370-6},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/BrandstadtLS97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/HougardyLW97,
author = {Stefan Hougardy and
Van Bang Le and
Annegret Wagler},
title = {Wing-triangulated graphs are perfect},
journal = {J. Graph Theory},
volume = {24},
number = {1},
pages = {25--31},
year = {1997},
url = {https://doi.org/10.1002/(SICI)1097-0118(199701)24:1\&\#60;25::AID-JGT4\&\#62;3.0.CO;2-L},
doi = {10.1002/(SICI)1097-0118(199701)24:1\&\#60;25::AID-JGT4\&\#62;3.0.CO;2-L},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/HougardyLW97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Le96,
author = {Van Bang Le},
title = {Gallai graphs and anti-Gallai graphs},
journal = {Discret. Math.},
volume = {159},
number = {1-3},
pages = {179--189},
year = {1996},
url = {https://doi.org/10.1016/0012-365X(95)00109-A},
doi = {10.1016/0012-365X(95)00109-A},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Le96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Le96,
author = {Van Bang Le},
title = {Cycle-perfect graphs are perfect},
journal = {J. Graph Theory},
volume = {23},
number = {4},
pages = {351--353},
year = {1996},
url = {https://doi.org/10.1002/(SICI)1097-0118(199612)23:4\&\#60;351::AID-JGT3\&\#62;3.0.CO;2-Q},
doi = {10.1002/(SICI)1097-0118(199612)23:4\&\#60;351::AID-JGT3\&\#62;3.0.CO;2-Q},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Le96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/LeP94,
author = {Van Bang Le and
Erich Prisner},
title = {Iterated\emph{k}-line graphs},
journal = {Graphs Comb.},
volume = {10},
number = {2-4},
pages = {193--203},
year = {1994},
url = {https://doi.org/10.1007/BF02986664},
doi = {10.1007/BF02986664},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/LeP94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Le93,
author = {Van Bang Le},
title = {Perfect \emph{k}-line graphs and \emph{k}-total graphs},
journal = {J. Graph Theory},
volume = {17},
number = {1},
pages = {65--73},
year = {1993},
url = {https://doi.org/10.1002/jgt.3190170108},
doi = {10.1002/JGT.3190170108},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Le93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/LeP92,
author = {Van Bang Le and
Erich Prisner},
title = {On inverse problems for the cycle graph operator},
journal = {Graphs Comb.},
volume = {8},
number = {2},
pages = {155--164},
year = {1992},
url = {https://doi.org/10.1007/BF02350633},
doi = {10.1007/BF02350633},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/LeP92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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.
last updated on 2024-04-21 17:56 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:
