default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVan Bang Le
Person information
- affiliation: University of Rostock, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j81]Sun-Yuan Hsieh, Hoàng-Oanh Le
, Van Bang Le, Sheng-Lung Peng:
On the d-Claw Vertex Deletion Problem. Algorithmica 86(2): 505-525 (2024)- [j80]Van Bang Le, Christian Rosenke:
Computing Optimal Leaf Roots of Chordal Cographs in Linear Time. J. Graph Algorithms Appl. 28(1): 243-274 (2024) - [j79]Hoàng-Oanh Le, Van Bang Le:
Complexity of the (Connected) Cluster Vertex Deletion Problem on H-free Graphs. Theory Comput. Syst. 68(2): 250-270 (2024) - [c31]Stefan Kratsch, Van Bang Le:
On Polynomial Kernelization for Stable Cutset. WG 2024: 358-373 - [i21]Hoàng-Oanh Le, Van Bang Le:
Complexity of the (Connected) Cluster Vertex Deletion problem on H-free graphs. CoRR abs/2402.04931 (2024) - [i20]Stefan Kratsch, Van Bang Le:
On polynomial kernelization for Stable Cutset. CoRR abs/2407.02086 (2024) - [i19]Sun-Yuan Hsieh, Hoàng-Oanh Le, Van Bang Le, Sheng-Lung Peng:
The complexity of strong conflict-free vertex-connection k-colorability. CoRR abs/2408.05865 (2024) - 2023
- [c30]Van Bang Le, Christian Rosenke:
Computing Optimal Leaf Roots of Chordal Cographs in Linear Time. FCT 2023: 348-362 - [c29]Hoàng-Oanh Le, Van Bang Le:
Complexity Results for Matching Cut Problems in Graphs Without Long Induced Paths. WG 2023: 417-431 - [i18]Hoàng-Oanh Le, Van Bang Le:
Complexity results for matching cut problems in graphs without long induced paths. CoRR abs/2307.05402 (2023) - [i17]Van Bang Le, Christian Rosenke:
Computing Optimal Leaf Roots of Chordal Cographs in Linear Time. CoRR abs/2308.10756 (2023) - [i16]Van Bang Le, Felicia Lucke, Daniël Paulusma, Bernard Ries:
Maximizing Matching Cuts. CoRR abs/2312.12960 (2023) - 2022
- [j78]Petr A. Golovach, Christian Komusiewicz, Dieter Kratsch, Van Bang Le:
Refined notions of parameterized enumeration kernels with applications to matching cut enumeration. J. Comput. Syst. Sci. 123: 76-102 (2022) - [j77]Van Bang Le, Jan Arne Telle:
The perfect matching cut problem revisited. Theor. Comput. Sci. 931: 117-130 (2022) - [c28]Hoàng-Oanh Le, Van Bang Le:
Complexity of the Cluster Vertex Deletion Problem on H-Free Graphs. MFCS 2022: 68:1-68:10 - [i15]Sun-Yuan Hsieh, Hoàng-Oanh Le, Van Bang Le, Sheng-Lung Peng:
On the d-Claw Vertex Deletion Problem. CoRR abs/2203.06766 (2022) - 2021
- [j76]Chi-Yeh Chen, Sun-Yuan Hsieh, Hoàng-Oanh Le, Van Bang Le, Sheng-Lung Peng:
Matching Cut in Graphs with Large Minimum Degree. Algorithmica 83(5): 1238-1255 (2021) - [c27]Sun-Yuan Hsieh, Van Bang Le, Sheng-Lung Peng:
On the d-Claw Vertex Deletion Problem. COCOON 2021: 591-603 - [c26]Petr A. Golovach, Christian Komusiewicz, Dieter Kratsch, Van Bang Le:
Refined Notions of Parameterized Enumeration Kernels with Applications to Matching Cut Enumeration. STACS 2021: 37:1-37:18 - [c25]Van Bang Le, Jan Arne Telle:
The Perfect Matching Cut Problem Revisited. WG 2021: 182-194 - [i14]Petr A. Golovach, Christian Komusiewicz, Dieter Kratsch, Van Bang Le:
Refined Notions of Parameterized Enumeration Kernels with Applications to Matching Cut Enumeration. CoRR abs/2101.03800 (2021) - [i13]Van Bang Le, Jan Arne Telle:
The Perfect Matching Cut Problem Revisited. CoRR abs/2107.06399 (2021) - 2020
- [j75]Van Bang Le, Florian Pfender:
Color-line and proper color-line graphs. Discret. Appl. Math. 278: 73-82 (2020) - [j74]Christian Komusiewicz, Dieter Kratsch, Van Bang Le:
Matching cut: Kernelization, single-exponential time FPT, and exact exponential algorithms. Discret. Appl. Math. 283: 44-58 (2020)
2010 – 2019
- 2019
- [j73]Hoàng-Oanh Le, Van Bang Le:
Hardness and Structural Results for Half-Squares of Restricted Tree Convex Bipartite Graphs. Algorithmica 81(11-12): 4258-4274 (2019) - [j72]Hoàng-Oanh Le, Van Bang Le:
A complexity dichotomy for matching cut in (bipartite) graphs of fixed diameter. Theor. Comput. Sci. 770: 69-78 (2019) - [j71]Hoàng-Oanh Le, Van Bang Le:
Map graphs having witnesses of large girth. Theor. Comput. Sci. 772: 143-148 (2019) - [c24]Sun-Yuan Hsieh, Hoàng-Oanh Le, Van Bang Le, Sheng-Lung Peng:
Matching Cut in Graphs with Large Minimum Degree. COCOON 2019: 301-312 - [c23]Hoàng-Oanh Le, Van Bang Le:
Constrained Representations of Map Graphs and Half-Squares. MFCS 2019: 13:1-13:15 - 2018
- [j70]Van Bang Le, Sheng-Lung Peng:
On the complete width and edge clique cover problems. J. Comb. Optim. 36(2): 532-548 (2018) - [c22]Christian Komusiewicz, Dieter Kratsch, Van Bang Le:
Matching Cut: Kernelization, Single-Exponential Time FPT, and Exact Exponential Algorithms. IPEC 2018: 19:1-19:13 - [i12]Hoàng-Oanh Le, Van Bang Le:
Hardness and structural results for half-squares of restricted tree convex bipartite graphs. CoRR abs/1804.05793 (2018) - [i11]Hoàng-Oanh Le, Van Bang Le:
A complexity dichotomy for Matching Cut in (bipartite) graphs of fixed diameter. CoRR abs/1804.11102 (2018) - [i10]Hoàng-Oanh Le, Van Bang Le:
Map graphs having witnesses of large girth. CoRR abs/1812.04102 (2018) - 2017
- [j69]Feodor F. Dragan, Dieter Kratsch, Van Bang Le:
Preface: Special graph classes and algorithms-in honor of Professor Andreas Brandstädt on the occasion of his 65th birthday. Discret. Appl. Math. 216: 1 (2017) - [j68]Van Bang Le, Thomas Podelleck:
Characterization and recognition of some opposition and coalition graph classes. Discret. Appl. Math. 216: 261-272 (2017) - [j67]Van Bang Le, Sheng-Lung Peng:
Good characterizations and linear time recognition for 2-probe block graphs. Discret. Appl. Math. 231: 181-189 (2017) - [c21]Hoàng-Oanh Le, Van Bang Le:
Hardness and Structural Results for Half-Squares of Restricted Tree Convex Bipartite Graphs. COCOON 2017: 359-370 - 2016
- [j66]Dieter Kratsch, Van Bang Le:
Algorithms solving the Matching Cut problem. Theor. Comput. Sci. 609: 328-335 (2016) - [j65]Van Bang Le, Andrea Oversberg, Oliver Schaudt:
A unified approach to recognize squares of split graphs. Theor. Comput. Sci. 648: 26-33 (2016) - [c20]Hoàng-Oanh Le, Van Bang Le:
On the Complexity of Matching Cut in Graphs of Fixed Diameter. ISAAC 2016: 50:1-50:12 - [i9]Van Bang Le, Sheng-Lung Peng:
Good characterizations and linear time recognition for 2-probe block graphs. CoRR abs/1611.06285 (2016) - [i8]Van Bang Le, Sheng-Lung Peng:
On the complete width and edge clique cover problems. CoRR abs/1612.08057 (2016) - 2015
- [j64]Felix Joos, Van Bang Le, Dieter Rautenbach:
Forests and trees among Gallai graphs. Discret. Math. 338(2): 190-195 (2015) - [j63]Van Bang Le, Sheng-Lung Peng:
Characterizing and recognizing probe block graphs. Theor. Comput. Sci. 568: 97-102 (2015) - [j62]Van Bang Le, Andrea Oversberg, Oliver Schaudt:
Polynomial time recognition of squares of Ptolemaic graphs and 3-sun-free split graphs. Theor. Comput. Sci. 602: 39-49 (2015) - [c19]Dieter Kratsch, Van Bang Le:
Algorithms Solving the Matching Cut Problem. CIAC 2015: 288-299 - [c18]Van Bang Le, Sheng-Lung Peng:
On the Complete Width and Edge Clique Cover Problems. COCOON 2015: 537-547 - [i7]Van Bang Le, Thomas Podelleck:
Characterization and recognition of some opposition and coalition graph classes. CoRR abs/1507.00557 (2015) - [i6]Van Bang Le, Florian Pfender:
Color-line and Proper Color-line Graphs. CoRR abs/1511.01025 (2015) - 2014
- [j61]Andreas Brandstädt, Konrad Engel, Hans-Dietrich O. F. Gronau, Roger Labahn, Van Bang Le, Florian Pfender:
Preface. Discret. Appl. Math. 163: 101 (2014) - [j60]Van Bang Le:
On opposition graphs, coalition graphs, and bipartite permutation graphs. Discret. Appl. Math. 168: 26-33 (2014) - [j59]Andreas Brandstädt, Van Bang Le:
A note on efficient domination in a superclass of P5-free graphs. Inf. Process. Lett. 114(7): 357-359 (2014) - [j58]Van Bang Le, Florian Pfender:
Complexity results for rainbow matchings. Theor. Comput. Sci. 524: 27-33 (2014) - [j57]Van Bang Le, Ragnar Nevries:
Complexity and algorithms for recognizing polar and monopolar graphs. Theor. Comput. Sci. 528: 1-11 (2014) - [c17]Van Bang Le, Sheng-Lung Peng:
Good characterizations and linear time recognition for 2-probe block graphs. ICS 2014: 22-31 - [c16]Van Bang Le, Andrea Oversberg, Oliver Schaudt:
Polynomial Time Recognition of Squares of Ptolemaic Graphs and 3-sun-free Split Graphs. WG 2014: 360-371 - [i5]Van Bang Le, Andrea Oversberg, Oliver Schaudt:
Polynomial time recognition of squares of ptolemaic graphs and 3-sun-free split graphs. CoRR abs/1402.0024 (2014) - [i4]Van Bang Le, Andrea Oversberg, Oliver Schaudt:
Squares of $3$-sun-free split graphs. CoRR abs/1410.2075 (2014) - 2013
- [j56]Van Bang Le, Florian Pfender:
Extremal Graphs Having No Stable Cutset. Electron. J. Comb. 20(1): 35 (2013) - [j55]Van Bang Le, Dieter Rautenbach:
Integral mixed unit interval graphs. Discret. Appl. Math. 161(7-8): 1028-1036 (2013) - [i3]Van Bang Le, Florian Pfender:
Complexity Results for Rainbow Matchings. CoRR abs/1312.7253 (2013) - 2012
- [j54]Babak Farzad, Lap Chi Lau, Van Bang Le, Nguyen Ngoc Tuy:
Complexity of Finding Graph Roots with Girth Conditions. Algorithmica 62(1-2): 38-53 (2012) - [j53]Mitre Costa Dourado, Van Bang Le, Fábio Protti, Dieter Rautenbach, Jayme Luiz Szwarcfiter:
Mixed unit interval graphs. Discret. Math. 312(22): 3357-3363 (2012) - [c15]Van Bang Le, Dieter Rautenbach:
Integral Mixed Unit Interval Graphs. COCOON 2012: 495-506 - 2011
- [j52]Van Bang Le:
Two characterizations of chain partitioned probe graphs. Ann. Oper. Res. 188(1): 279-283 (2011) - [j51]Andreas Brandstädt, Martin Charles Golumbic, Van Bang Le, Marina Lipshteyn:
Path-Bicolorable Graphs. Graphs Comb. 27(6): 799-819 (2011) - [j50]Van Bang Le, Nguyen Ngoc Tuy:
A good characterization of squares of strongly chordal split graphs. Inf. Process. Lett. 111(3): 120-123 (2011) - [c14]Van Bang Le, Ragnar Nevries:
Recognizing Polar Planar Graphs Using New Results for Monopolarity. ISAAC 2011: 120-129 - 2010
- [j49]Van Bang Le, Nguyen Ngoc Tuy:
The square of a block graph. Discret. Math. 310(4): 734-741 (2010) - [j48]Andreas Brandstädt, Van Bang Le, Dieter Rautenbach:
Exact leaf powers. Theor. Comput. Sci. 411(31-33): 2968-2977 (2010)
2000 – 2009
- 2009
- [j47]Andreas Brandstädt, Konrad Engel, Hans-Dietrich O. F. Gronau, Van Bang Le:
Preface. Discret. Appl. Math. 157(9): 1979 (2009) - [j46]Andreas Brandstädt, Van Bang Le, Dieter Rautenbach:
A forbidden induced subgraph characterization of distance-hereditary 5-leaf powers. Discret. Math. 309(12): 3843-3852 (2009) - [j45]Daniel Bayer, Van Bang Le, H. N. de Ridder:
Probe threshold and probe trivially perfect graphs. Theor. Comput. Sci. 410(47-49): 4812-4822 (2009) - [j44]Andreas Brandstädt, Van Bang Le:
Simplicial powers of graphs. Theor. Comput. Sci. 410(52): 5443-5454 (2009) - [c13]Andreas Brandstädt, Martin Charles Golumbic, Van Bang Le, Marina Lipshteyn:
Path-Bicolorable Graphs. Graph Theory, Computational Intelligence and Thought 2009: 172-182 - [c12]Babak Farzad, Lap Chi Lau, Van Bang Le, Nguyen Ngoc Tuy:
Computing Graph Roots Without Short Cycles. STACS 2009: 397-408 - [c11]Van Bang Le, Nguyen Ngoc Tuy:
Hardness Results and Efficient Algorithms for Graph Powers. WG 2009: 238-249 - [i2]Babak Farzad, Lap Chi Lau, Van Bang Le, Nguyen Ngoc Tuy:
Computing Graph Roots Without Short Cycles. CoRR abs/0902.2150 (2009) - 2008
- [j43]Van Bang Le, Raffaele Mosca, Haiko Müller:
On stable cutsets in claw-free graphs and planar graphs. J. Discrete Algorithms 6(2): 256-276 (2008) - [j42]Andreas Brandstädt, Van Bang Le, R. Sritharan:
Structure and linear-time recognition of 4-leaf powers. ACM Trans. Algorithms 5(1): 11:1-11:22 (2008) - [c10]Andreas Brandstädt, Van Bang Le:
Simplicial Powers of Graphs. COCOA 2008: 160-170 - [c9]David B. Chandler, Maw-Shang Chang, Ton Kloks, Van Bang Le, Sheng-Lung Peng:
Probe Ptolemaic Graphs. COCOON 2008: 468-477 - 2007
- [j41]Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Van Bang Le, Ryuhei Uehara:
Tree Spanners for Bipartite Graphs and Probe Interval Graphs. Algorithmica 47(1): 27-51 (2007) - [j40]Van Bang Le, H. N. de Ridder:
Probe Split Graphs. Discret. Math. Theor. Comput. Sci. 9(1) (2007) - [j39]Andreas Brandstädt, Van Bang Le, Suhail Mahfud:
New applications of clique separator decomposition for the Maximum Weight Stable Set problem. Theor. Comput. Sci. 370(1-3): 229-239 (2007) - [j38]Van Bang Le, Bert Randerath, Ingo Schiermeyer:
On the complexity of 4-coloring graphs without long induced paths. Theor. Comput. Sci. 389(1-2): 330-335 (2007) - [c8]Van Bang Le, H. N. de Ridder:
Characterisations and Linear-Time Recognition of Probe Cographs. WG 2007: 226-237 - [i1]Van Bang Le, H. N. de Ridder:
Linear-time certifying recognition for partitioned probe cographs. Exact, Approximative, Robust and Certifying Algorithms on Particular Graph Classes 2007 - 2006
- [j37]H. N. de Ridder, Van Bang Le, Daniel Bayer:
On probe classes of graphs. Electron. Notes Discret. Math. 27: 21 (2006) - [j36]Nguyen Ngoc Tuy, Jörg Bornemann, Van Bang Le:
Graph classes related to chordal graphs and chordal bipartite graphs. Electron. Notes Discret. Math. 27: 73-74 (2006) - [j35]Dieter Rautenbach, Andreas Brandstädt, Van Bang Le:
Distance-Hereditary 5-Leaf Powers. Electron. Notes Discret. Math. 27: 85-86 (2006) - [j34]Andreas Brandstädt, Van Bang Le:
Structure and linear time recognition of 3-leaf powers. Inf. Process. Lett. 98(4): 133-138 (2006) - 2005
- [j33]Andreas Brandstädt, Peter L. Hammer, Van Bang Le, Vadim V. Lozin:
Bisplit graphs. Discret. Math. 299(1-3): 11-32 (2005) - [c7]Andreas Brandstädt, Van Bang Le, Suhail Mahfud:
New Applications of Clique Separator Decomposition for the Maximum Weight Stable Set Problem. FCT 2005: 516-527 - [c6]Van Bang Le, Raffaele Mosca, Haiko Müller:
On Stable Cutsets in Claw-Free Graphs and Planar Graphs. WG 2005: 163-174 - 2004
- [j32]Van Bang Le, Jeremy P. Spinrad:
Consequences of an algorithm for bridged graphs. Discret. Math. 280(1-3): 271-274 (2004) - [j31]Andreas Brandstädt, Van Bang Le, H. N. de Ridder:
Efficient robust algorithms for the Maximum Weight Stable Set Problem in chair-free graph classes. Inf. Process. Lett. 89(4): 165-173 (2004) - [j30]Andreas Brandstädt, Van Bang Le:
Split-Perfect Graphs: Characterizations and Algorithmic Use. SIAM J. Discret. Math. 17(3): 341-360 (2004) - [j29]Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Van Bang Le:
Tree spanners on chordal graphs: complexity and algorithms. Theor. Comput. Sci. 310(1-3): 329-354 (2004) - 2003
- [j28]Van Bang Le:
Bipartite-perfect Graphs. Discret. Appl. Math. 127(3): 581-599 (2003) - [j27]Andreas Brandstädt, Chính T. Hoàng, Van Bang Le:
Stability number of bull- and chair-free graphs revisited. Discret. Appl. Math. 131(1): 39-50 (2003) - [j26]Hoàng-Oanh Le, Van Bang Le, Haiko Müller:
Splitting a graph into disjoint induced paths or cycles. Discret. Appl. Math. 131(1): 199-212 (2003) - [j25]Jirí Fiala, Klaus Jansen, Van Bang Le, Eike Seidel:
Graph Subcolorings: Complexity and Algorithms. SIAM J. Discret. Math. 16(4): 635-650 (2003) - [j24]Van Bang Le, Bert Randerath:
On stable cutsets in line graphs. Theor. Comput. Sci. 301(1-3): 463-475 (2003) - [c5]Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Van Bang Le, Ryuhei Uehara:
Tree Spanners for Bipartite Graphs and Probe Interval Graphs. WG 2003: 106-118 - 2002
- [j23]Luitpold Babel, Andreas Brandstädt, Van Bang Le:
Recognizing the P4-structure of claw-free graphs and a larger graph class. Discret. Math. Theor. Comput. Sci. 5(1): 127-146 (2002) - [j22]Hoàng-Oanh Le, Van Bang Le:
The NP-completeness of (1, r)-subcolorability of cubic graphs. Inf. Process. Lett. 81(3): 157-162 (2002) - [j21]Andreas Brandstädt, Hoàng-Oanh Le, Van Bang Le:
On alpha-redundant vertices in P5-free graphs. Inf. Process. Lett. 82(3): 119-122 (2002) - [c4]Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Van Bang Le:
Tree Spanners on Chordal Graphs: Complexity, Algorithms, Open Problems. ISAAC 2002: 163-174 - 2001
- [j20]Chính T. Hoàng, Van Bang Le:
P4-Colorings and P4-Bipartite Graphs. Discret. Math. Theor. Comput. Sci. 4(2): 109-122 (2001) - [c3]Jirí Fiala, Klaus Jansen, Van Bang Le, Eike Seidel:
Graph Subcolorings: Complexity and Algorithms. WG 2001: 154-165 - [c2]Van Bang Le, Bert Randerath:
On Stable Cutsets in Line Graphs. WG 2001: 263-271 - [e1]Andreas Brandstädt, Van Bang Le:
Graph-Theoretic Concepts in Computer Science, 27th International Workshop, WG 2001, Boltenhagen, Germany, June 14-16, 2001, Proceedings. Lecture Notes in Computer Science 2204, Springer 2001, ISBN 3-540-42707-4 [contents] - 2000
- [j19]Andreas Brandstädt, Van Bang Le:
Recognizing the P4-structure of Block Graphs. Discret. Appl. Math. 99(1-3): 349-366 (2000) - [j18]Andreas Brandstädt, Feodor F. Dragan, Van Bang Le, Thomas Szymczak:
On stable cutsets in graphs. Discret. Appl. Math. 105(1-3): 39-50 (2000) - [j17]Chính T. Hoàng, Van Bang Le:
On P4-transversals of perfect graphs. Discret. Math. 216(1-3): 195-210 (2000) - [j16]Van Bang Le:
Some conjectures on perfect graphs. Discuss. Math. Graph Theory 20(1): 155-159 (2000) - [j15]Andreas Brandstädt, Van Bang Le, Stephan Olariu:
Efficiently Recognizing the P 4-Structure of Trees and of Bipartite Graphs Without Short Cycles. Graphs Comb. 16(4): 381-387 (2000) - [j14]Chính T. Hoàng, Van Bang Le:
Recognizing Perfect 2-Split Graphs. SIAM J. Discret. Math. 13(1): 48-55 (2000) - [c1]Andreas Brandstädt, Van Bang Le:
Split-Perfect Graphs: Characterizations and Algorithmic Use. WG 2000: 71-82
1990 – 1999
- 1999
- [j13]Luitpold Babel, Andreas Brandstädt, Van Bang Le:
Recognizing the P4-structure of Bipartite Graphs. Discret. Appl. Math. 93(2-3): 157-168 (1999) - [j12]Andreas Brandstädt, Van Bang Le:
Tree- and Forest-perfect Graphs. Discret. Appl. Math. 95(1-3): 141-162 (1999) - [j11]Van Bang Le:
Bipartite-Perfect Graphs. Electron. Notes Discret. Math. 3: 7-12 (1999) - [j10]Van Bang Le:
A good characterization of cograph contractions. J. Graph Theory 30(4): 309-318 (1999) - [j9]Hoàng-Oanh Le, Van Bang Le:
Optimal tree 3-spanners in directed path graphs. Networks 34(2): 81-87 (1999) - 1998
- [j8]Andreas Brandstädt, Van Bang Le, Thomas Szymczak:
The Complexity of some Problems Related to Graph 3-colorability. Discret. Appl. Math. 89(1-3): 59-73 (1998) - 1997
- [j7]Andreas Brandstädt, Van Bang Le, Thomas Szymczak:
Duchet-type theorems for powers of HHD-free graphs. Discret. Math. 177(1-3): 9-16 (1997) - [j6]Stefan Hougardy, Van Bang Le, Annegret Wagler:
Wing-triangulated graphs are perfect. J. Graph Theory 24(1): 25-31 (1997) - 1996
- [j5]Van Bang Le:
Gallai graphs and anti-Gallai graphs. Discret. Math. 159(1-3): 179-189 (1996) - [j4]Van Bang Le:
Cycle-perfect graphs are perfect. J. Graph Theory 23(4): 351-353 (1996) - 1994
- [j3]Van Bang Le, Erich Prisner:
Iteratedk-line graphs. Graphs Comb. 10(2-4): 193-203 (1994) - 1993
- [j2]Van Bang Le:
Perfect k-line graphs and k-total graphs. J. Graph Theory 17(1): 65-73 (1993) - 1992
- [j1]Van Bang Le, Erich Prisner:
On inverse problems for the cycle graph operator. Graphs Comb. 8(2): 155-164 (1992)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-02-18 01:17 CET 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:
