Van Bang Le - RankMe

139 papers A 3B 20C 2Misc 6Journal 105Unranked 3

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Complexity and algorithms for matching cut problems in graphs without long induced paths and cycles. J. Comput. Syst. Sci. Hoàng-Oanh Le, Van Bang Le
2026	J	`jnl`	On polynomial kernelization for Stable Cutset. Discret. Appl. Math. Stefan Kratsch, Van Bang Le
2026	J	`jnl`	The parameterized complexity of Strong Conflict-Free Vertex-Connection Colorability. Discret. Appl. Math. Carl Feghali, Hoàng-Oanh Le, Van Bang Le
2025	J	`jnl`	The parameterized complexity of Strong Conflict-Free Vertex-Connection Colorability. CoRR Carl Feghali, Hoàng-Oanh Le, Van Bang Le
2024	J	`jnl`	Complexity of the (Connected) Cluster Vertex Deletion Problem on H-free Graphs. Theory Comput. Syst. Hoàng-Oanh Le, Van Bang Le
2024	J	`jnl`	Complexity of the (Connected) Cluster Vertex Deletion problem on H-free graphs. CoRR Hoàng-Oanh Le, Van Bang Le
2024	J	`jnl`	Computing Optimal Leaf Roots of Chordal Cographs in Linear Time. J. Graph Algorithms Appl. Van Bang Le, Christian Rosenke
2024	B	`conf`	On Polynomial Kernelization for Stable Cutset. WG Stefan Kratsch, Van Bang Le
2024	J	`jnl`	On polynomial kernelization for Stable Cutset. CoRR Stefan Kratsch, Van Bang Le
2024	J	`jnl`	On the d-Claw Vertex Deletion Problem. Algorithmica Sun-Yuan Hsieh, Hoàng-Oanh Le, Van Bang Le, Sheng-Lung Peng
2024	—	`conf`	The Complexity of Strong Conflict-Free Vertex-Connection k-colorability. COCOON (1) Sun-Yuan Hsieh, Hoàng-Oanh Le, Van Bang Le, Sheng-Lung Peng
2024	J	`jnl`	The complexity of strong conflict-free vertex-connection CoRR Sun-Yuan Hsieh, Hoàng-Oanh Le, Van Bang Le, Sheng-Lung Peng
2023	B	`conf`	Complexity Results for Matching Cut Problems in Graphs Without Long Induced Paths. WG Hoàng-Oanh Le, Van Bang Le
2023	J	`jnl`	Complexity results for matching cut problems in graphs without long induced paths. CoRR Hoàng-Oanh Le, Van Bang Le
2023	B	`conf`	Computing Optimal Leaf Roots of Chordal Cographs in Linear Time. FCT Van Bang Le, Christian Rosenke
2023	J	`jnl`	Computing Optimal Leaf Roots of Chordal Cographs in Linear Time. CoRR Van Bang Le, Christian Rosenke
2023	J	`jnl`	Maximizing Matching Cuts. CoRR Van Bang Le, Felicia Lucke, Daniël Paulusma, Bernard Ries
2022	B	`conf`	Complexity of the Cluster Vertex Deletion Problem on H-Free Graphs. MFCS Hoàng-Oanh Le, Van Bang Le
2022	J	`jnl`	On the d-Claw Vertex Deletion Problem. CoRR Sun-Yuan Hsieh, Hoàng-Oanh Le, Van Bang Le, Sheng-Lung Peng
2022	J	`jnl`	Refined notions of parameterized enumeration kernels with applications to matching cut enumeration. J. Comput. Syst. Sci. Petr A. Golovach, Christian Komusiewicz, Dieter Kratsch, Van Bang Le
2022	J	`jnl`	The perfect matching cut problem revisited. Theor. Comput. Sci. Van Bang Le, Jan Arne Telle
2021	J	`jnl`	Matching Cut in Graphs with Large Minimum Degree. Algorithmica Chi-Yeh Chen, Sun-Yuan Hsieh, Hoàng-Oanh Le, Van Bang Le, Sheng-Lung Peng
2021	Misc	`conf`	On the d-Claw Vertex Deletion Problem. COCOON Sun-Yuan Hsieh, Van Bang Le, Sheng-Lung Peng
2021	A	`conf`	Refined Notions of Parameterized Enumeration Kernels with Applications to Matching Cut Enumeration. STACS Petr A. Golovach, Christian Komusiewicz, Dieter Kratsch, Van Bang Le
2021	J	`jnl`	Refined Notions of Parameterized Enumeration Kernels with Applications to Matching Cut Enumeration. CoRR Petr A. Golovach, Christian Komusiewicz, Dieter Kratsch, Van Bang Le
2021	B	`conf`	The Perfect Matching Cut Problem Revisited. WG Van Bang Le, Jan Arne Telle
2021	J	`jnl`	The Perfect Matching Cut Problem Revisited. CoRR Van Bang Le, Jan Arne Telle
2020	J	`jnl`	Color-line and proper color-line graphs. Discret. Appl. Math. Van Bang Le, Florian Pfender
2020	J	`jnl`	Matching cut: Kernelization, single-exponential time FPT, and exact exponential algorithms. Discret. Appl. Math. Christian Komusiewicz, Dieter Kratsch, Van Bang Le
2019	J	`jnl`	A complexity dichotomy for matching cut in (bipartite) graphs of fixed diameter. Theor. Comput. Sci. Hoàng-Oanh Le, Van Bang Le
2019	B	`conf`	Constrained Representations of Map Graphs and Half-Squares. MFCS Hoàng-Oanh Le, Van Bang Le
2019	J	`jnl`	Hardness and Structural Results for Half-Squares of Restricted Tree Convex Bipartite Graphs. Algorithmica Hoàng-Oanh Le, Van Bang Le
2019	J	`jnl`	Map graphs having witnesses of large girth. Theor. Comput. Sci. Hoàng-Oanh Le, Van Bang Le
2019	Misc	`conf`	Matching Cut in Graphs with Large Minimum Degree. COCOON Sun-Yuan Hsieh, Hoàng-Oanh Le, Van Bang Le, Sheng-Lung Peng
2018	J	`jnl`	A complexity dichotomy for Matching Cut in (bipartite) graphs of fixed diameter. CoRR Hoàng-Oanh Le, Van Bang Le
2018	J	`jnl`	Hardness and structural results for half-squares of restricted tree convex bipartite graphs. CoRR Hoàng-Oanh Le, Van Bang Le
2018	J	`jnl`	Map graphs having witnesses of large girth. CoRR Hoàng-Oanh Le, Van Bang Le
2018	B	`conf`	Matching Cut: Kernelization, Single-Exponential Time FPT, and Exact Exponential Algorithms. IPEC Christian Komusiewicz, Dieter Kratsch, Van Bang Le
2018	J	`jnl`	On the complete width and edge clique cover problems. J. Comb. Optim. Van Bang Le, Sheng-Lung Peng
2017	J	`jnl`	Characterization and recognition of some opposition and coalition graph classes. Discret. Appl. Math. Van Bang Le, Thomas Podelleck
2017	J	`jnl`	Good characterizations and linear time recognition for 2-probe block graphs. Discret. Appl. Math. Van Bang Le, Sheng-Lung Peng
2017	Misc	`conf`	Hardness and Structural Results for Half-Squares of Restricted Tree Convex Bipartite Graphs. COCOON Hoàng-Oanh Le, Van Bang Le
2017	J	`jnl`	Preface: Special graph classes and algorithms-in honor of Professor Andreas Brandstädt on the occasion of his 65th birthday. Discret. Appl. Math. Feodor F. Dragan, Dieter Kratsch, Van Bang Le
2016	J	`jnl`	A unified approach to recognize squares of split graphs. Theor. Comput. Sci. Van Bang Le, Andrea Oversberg, Oliver Schaudt
2016	J	`jnl`	Algorithms solving the Matching Cut problem. Theor. Comput. Sci. Dieter Kratsch, Van Bang Le
2016	J	`jnl`	Good characterizations and linear time recognition for 2-probe block graphs. CoRR Van Bang Le, Sheng-Lung Peng
2016	B	`conf`	On the Complexity of Matching Cut in Graphs of Fixed Diameter. ISAAC Hoàng-Oanh Le, Van Bang Le
2016	J	`jnl`	On the complete width and edge clique cover problems. CoRR Van Bang Le, Sheng-Lung Peng
2015	C	`conf`	Algorithms Solving the Matching Cut Problem. CIAC Dieter Kratsch, Van Bang Le
2015	J	`jnl`	Characterization and recognition of some opposition and coalition graph classes. CoRR Van Bang Le, Thomas Podelleck
2015	J	`jnl`	Characterizing and recognizing probe block graphs. Theor. Comput. Sci. Van Bang Le, Sheng-Lung Peng
2015	J	`jnl`	Color-line and Proper Color-line Graphs. CoRR Van Bang Le, Florian Pfender
2015	J	`jnl`	Forests and trees among Gallai graphs. Discret. Math. Felix Joos, Van Bang Le, Dieter Rautenbach
2015	Misc	`conf`	On the Complete Width and Edge Clique Cover Problems. COCOON Van Bang Le, Sheng-Lung Peng
2015	J	`jnl`	Polynomial time recognition of squares of Ptolemaic graphs and 3-sun-free split graphs. Theor. Comput. Sci. Van Bang Le, Andrea Oversberg, Oliver Schaudt
2014	J	`jnl`	A note on efficient domination in a superclass of P Inf. Process. Lett. Andreas Brandstädt, Van Bang Le
2014	J	`jnl`	Complexity and algorithms for recognizing polar and monopolar graphs. Theor. Comput. Sci. Van Bang Le, Ragnar Nevries
2014	J	`jnl`	Complexity results for rainbow matchings. Theor. Comput. Sci. Van Bang Le, Florian Pfender
2014	A	`conf`	Good characterizations and linear time recognition for 2-probe block graphs. ICS Van Bang Le, Sheng-Lung Peng
2014	J	`jnl`	On opposition graphs, coalition graphs, and bipartite permutation graphs. Discret. Appl. Math. Van Bang Le
2014	B	`conf`	Polynomial Time Recognition of Squares of Ptolemaic Graphs and 3-sun-free Split Graphs. WG Van Bang Le, Andrea Oversberg, Oliver Schaudt
2014	J	`jnl`	Polynomial time recognition of squares of ptolemaic graphs and 3-sun-free split graphs. CoRR Van Bang Le, Andrea Oversberg, Oliver Schaudt
2014	J	`jnl`	Preface. Discret. Appl. Math. Andreas Brandstädt, Konrad Engel, Hans-Dietrich O. F. Gronau, Roger Labahn, Van Bang Le, Florian Pfender
2014	J	`jnl`	Squares of $3$-sun-free split graphs. CoRR Van Bang Le, Andrea Oversberg, Oliver Schaudt
2013	J	`jnl`	Complexity Results for Rainbow Matchings. CoRR Van Bang Le, Florian Pfender
2013	J	`jnl`	Extremal Graphs Having No Stable Cutset. Electron. J. Comb. Van Bang Le, Florian Pfender
2013	J	`jnl`	Integral mixed unit interval graphs. Discret. Appl. Math. Van Bang Le, Dieter Rautenbach
2012	J	`jnl`	Complexity of Finding Graph Roots with Girth Conditions. Algorithmica Babak Farzad, Lap Chi Lau, Van Bang Le, Nguyen Ngoc Tuy
2012	Misc	`conf`	Integral Mixed Unit Interval Graphs. COCOON Van Bang Le, Dieter Rautenbach
2012	J	`jnl`	Mixed unit interval graphs. Discret. Math. Mitre Costa Dourado, Van Bang Le, Fábio Protti, Dieter Rautenbach, Jayme Luiz Szwarcfiter
2011	J	`jnl`	A good characterization of squares of strongly chordal split graphs. Inf. Process. Lett. Van Bang Le, Nguyen Ngoc Tuy
2011	J	`jnl`	Path-Bicolorable Graphs. Graphs Comb. Andreas Brandstädt, Martin Charles Golumbic, Van Bang Le, Marina Lipshteyn
2011	B	`conf`	Recognizing Polar Planar Graphs Using New Results for Monopolarity. ISAAC Van Bang Le, Ragnar Nevries
2011	J	`jnl`	Two characterizations of chain partitioned probe graphs. Ann. Oper. Res. Van Bang Le
2010	J	`jnl`	Exact leaf powers. Theor. Comput. Sci. Andreas Brandstädt, Van Bang Le, Dieter Rautenbach
2010	J	`jnl`	The square of a block graph. Discret. Math. Van Bang Le, Nguyen Ngoc Tuy
2009	J	`jnl`	A forbidden induced subgraph characterization of distance-hereditary 5-leaf powers. Discret. Math. Andreas Brandstädt, Van Bang Le, Dieter Rautenbach
2009	J	`jnl`	Computing Graph Roots Without Short Cycles CoRR Babak Farzad, Lap Chi Lau, Van Bang Le, Nguyen Ngoc Tuy
2009	A	`conf`	Computing Graph Roots Without Short Cycles. STACS Babak Farzad, Lap Chi Lau, Van Bang Le, Nguyen Ngoc Tuy
2009	B	`conf`	Hardness Results and Efficient Algorithms for Graph Powers. WG Van Bang Le, Nguyen Ngoc Tuy
2009	—	`conf`	Path-Bicolorable Graphs. Graph Theory, Computational Intelligence and Thought Andreas Brandstädt, Martin Charles Golumbic, Van Bang Le, Marina Lipshteyn
2009	J	`jnl`	Preface. Discret. Appl. Math. Andreas Brandstädt, Konrad Engel, Hans-Dietrich O. F. Gronau, Van Bang Le
2009	J	`jnl`	Probe threshold and probe trivially perfect graphs. Theor. Comput. Sci. Daniel Bayer, Van Bang Le, H. N. de Ridder
2009	J	`jnl`	Simplicial powers of graphs. Theor. Comput. Sci. Andreas Brandstädt, Van Bang Le
2008	J	`jnl`	On stable cutsets in claw-free graphs and planar graphs. J. Discrete Algorithms Van Bang Le, Raffaele Mosca, Haiko Müller
2008	Misc	`conf`	Probe Ptolemaic Graphs. COCOON David B. Chandler, Maw-Shang Chang, Ton Kloks, Van Bang Le, Sheng-Lung Peng
2008	C	`conf`	Simplicial Powers of Graphs. COCOA Andreas Brandstädt, Van Bang Le
2008	J	`jnl`	Structure and linear-time recognition of 4-leaf powers. ACM Trans. Algorithms Andreas Brandstädt, Van Bang Le, R. Sritharan
2007	B	`conf`	Characterisations and Linear-Time Recognition of Probe Cographs. WG Van Bang Le, H. N. de Ridder
2007	—	`conf`	Linear-time certifying recognition for partitioned probe cographs. Exact, Approximative, Robust and Certifying Algorithms on Particular Graph Classes Van Bang Le, H. N. de Ridder
2007	J	`jnl`	New applications of clique separator decomposition for the Maximum Weight Stable Set problem. Theor. Comput. Sci. Andreas Brandstädt, Van Bang Le, Suhail Mahfud
2007	J	`jnl`	On the complexity of 4-coloring graphs without long induced paths. Theor. Comput. Sci. Van Bang Le, Bert Randerath, Ingo Schiermeyer
2007	J	`jnl`	Probe Split Graphs. Discret. Math. Theor. Comput. Sci. Van Bang Le, H. N. de Ridder
2007	J	`jnl`	Tree Spanners for Bipartite Graphs and Probe Interval Graphs. Algorithmica Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Van Bang Le, Ryuhei Uehara
2006	J	`jnl`	Distance-Hereditary 5-Leaf Powers. Electron. Notes Discret. Math. Dieter Rautenbach, Andreas Brandstädt, Van Bang Le
2006	J	`jnl`	Graph classes related to chordal graphs and chordal bipartite graphs. Electron. Notes Discret. Math. Nguyen Ngoc Tuy, Jörg Bornemann, Van Bang Le
2006	J	`jnl`	On probe classes of graphs. Electron. Notes Discret. Math. H. N. de Ridder, Van Bang Le, Daniel Bayer
2006	J	`jnl`	Structure and linear time recognition of 3-leaf powers. Inf. Process. Lett. Andreas Brandstädt, Van Bang Le
2005	J	`jnl`	Bisplit graphs. Discret. Math. Andreas Brandstädt, Peter L. Hammer, Van Bang Le, Vadim V. Lozin
2005	B	`conf`	New Applications of Clique Separator Decomposition for the Maximum Weight Stable Set Problem. FCT Andreas Brandstädt, Van Bang Le, Suhail Mahfud
2005	B	`conf`	On Stable Cutsets in Claw-Free Graphs and Planar Graphs. WG Van Bang Le, Raffaele Mosca, Haiko Müller
2004	J	`jnl`	Consequences of an algorithm for bridged graphs. Discret. Math. Van Bang Le, Jeremy P. Spinrad
2004	J	`jnl`	Efficient robust algorithms for the Maximum Weight Stable Set Problem in chair-free graph classes. Inf. Process. Lett. Andreas Brandstädt, Van Bang Le, H. N. de Ridder
2004	J	`jnl`	Split-Perfect Graphs: Characterizations and Algorithmic Use. SIAM J. Discret. Math. Andreas Brandstädt, Van Bang Le
2004	J	`jnl`	Tree spanners on chordal graphs: complexity and algorithms. Theor. Comput. Sci. Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Van Bang Le
2003	J	`jnl`	Bipartite-perfect Graphs. Discret. Appl. Math. Van Bang Le
2003	J	`jnl`	Graph Subcolorings: Complexity and Algorithms. SIAM J. Discret. Math. Jirí Fiala, Klaus Jansen, Van Bang Le, Eike Seidel
2003	J	`jnl`	On stable cutsets in line graphs. Theor. Comput. Sci. Van Bang Le, Bert Randerath
2003	J	`jnl`	Splitting a graph into disjoint induced paths or cycles. Discret. Appl. Math. Hoàng-Oanh Le, Van Bang Le, Haiko Müller
2003	J	`jnl`	Stability number of bull- and chair-free graphs revisited. Discret. Appl. Math. Andreas Brandstädt, Chính T. Hoàng, Van Bang Le
2003	B	`conf`	Tree Spanners for Bipartite Graphs and Probe Interval Graphs. WG Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Van Bang Le, Ryuhei Uehara
2002	J	`jnl`	On alpha-redundant vertices in P5-free graphs. Inf. Process. Lett. Andreas Brandstädt, Hoàng-Oanh Le, Van Bang Le
2002	J	`jnl`	Recognizing the P Discret. Math. Theor. Comput. Sci. Luitpold Babel, Andreas Brandstädt, Van Bang Le
2002	J	`jnl`	The NP-completeness of (1, r)-subcolorability of cubic graphs. Inf. Process. Lett. Hoàng-Oanh Le, Van Bang Le
2002	B	`conf`	Tree Spanners on Chordal Graphs: Complexity, Algorithms, Open Problems. ISAAC Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Van Bang Le
2001	B	`conf`	Graph Subcolorings: Complexity and Algorithms. WG Jirí Fiala, Klaus Jansen, Van Bang Le, Eike Seidel
2001	B	`ed.`	Graph-Theoretic Concepts in Computer Science, 27th International Workshop, WG 2001, Boltenhagen, Germany, June 14-16, 2001, Proceedings WG Andreas Brandstädt, Van Bang Le
2001	B	`conf`	On Stable Cutsets in Line Graphs. WG Van Bang Le, Bert Randerath
2001	J	`jnl`	P4-Colorings and P4-Bipartite Graphs. Discret. Math. Theor. Comput. Sci. Chính T. Hoàng, Van Bang Le
2000	J	`jnl`	Efficiently Recognizing the Graphs Comb. Andreas Brandstädt, Van Bang Le, Stephan Olariu
2000	J	`jnl`	On Discret. Math. Chính T. Hoàng, Van Bang Le
2000	J	`jnl`	On stable cutsets in graphs. Discret. Appl. Math. Andreas Brandstädt, Feodor F. Dragan, Van Bang Le, Thomas Szymczak
2000	J	`jnl`	Recognizing Perfect 2-Split Graphs. SIAM J. Discret. Math. Chính T. Hoàng, Van Bang Le
2000	J	`jnl`	Recognizing the P Discret. Appl. Math. Andreas Brandstädt, Van Bang Le
2000	J	`jnl`	Some conjectures on perfect graphs. Discuss. Math. Graph Theory Van Bang Le
2000	B	`conf`	Split-Perfect Graphs: Characterizations and Algorithmic Use. WG Andreas Brandstädt, Van Bang Le
1999	J	`jnl`	A good characterization of cograph contractions. J. Graph Theory Van Bang Le
1999	J	`jnl`	Bipartite-Perfect Graphs. Electron. Notes Discret. Math. Van Bang Le
1999	J	`jnl`	Optimal tree 3-spanners in directed path graphs. Networks Hoàng-Oanh Le, Van Bang Le
1999	J	`jnl`	Recognizing the P Discret. Appl. Math. Luitpold Babel, Andreas Brandstädt, Van Bang Le
1999	J	`jnl`	Tree- and Forest-perfect Graphs. Discret. Appl. Math. Andreas Brandstädt, Van Bang Le
1998	J	`jnl`	The Complexity of some Problems Related to Graph 3-colorability. Discret. Appl. Math. Andreas Brandstädt, Van Bang Le, Thomas Szymczak
1997	J	`jnl`	Duchet-type theorems for powers of HHD-free graphs. Discret. Math. Andreas Brandstädt, Van Bang Le, Thomas Szymczak
1997	J	`jnl`	Wing-triangulated graphs are perfect. J. Graph Theory Stefan Hougardy, Van Bang Le, Annegret K. Wagler
1996	J	`jnl`	Cycle-perfect graphs are perfect. J. Graph Theory Van Bang Le
1996	J	`jnl`	Gallai graphs and anti-Gallai graphs. Discret. Math. Van Bang Le
1994	J	`jnl`	Iterated Graphs Comb. Van Bang Le, Erich Prisner
1993	J	`jnl`	Perfect J. Graph Theory Van Bang Le
1992	J	`jnl`	On inverse problems for the cycle graph operator. Graphs Comb. Van Bang Le, Erich Prisner