Van Bang Le

Navedeno

	Vse	Od leta 2018
Navedbe	3953	1034
indeks h	22	14
indeks i10	55	17

280

140

210

199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202338 40 51 63 92 107 160 142 154 145 181 183 190 177 217 190 225 273 221 197 189 174 202 182 90

Javni dostop

Prikaži vse

3 članki

0 člankov

na voljo

ni na voljo

Na podlagi zahtev v povezavi s financiranjem

Soavtorji

Andreas BrandstädtProfessor of Computer Science, University of Rostock, Germany Preverjeni e-poštni naslov na uni-rostock.de
Feodor F. DraganKent State UniversityPreverjeni e-poštni naslov na CS.KENT.EDU
Chinh T. HoangProfessor of Computer Science, Wilfrid Laurier UniversityPreverjeni e-poštni naslov na wlu.ca
Sheng-Lung PengNational Taipei University of BusinessPreverjeni e-poštni naslov na ntub.edu.tw
Florian PfenderProfessor for Mathematics, University of Colorado DenverPreverjeni e-poštni naslov na ucdenver.edu
Dieter Kratschprofesseur d'informatique, Universite de LorrainePreverjeni e-poštni naslov na univ-lorraine.fr
Jiri FialaCharles UniversityPreverjeni e-poštni naslov na kam.mff.cuni.cz
Vadim LozinUniversity of WarwickPreverjeni e-poštni naslov na warwick.ac.uk
Erich PrisnerProfessor of Mathematics, Franklin University SwitzerlandPreverjeni e-poštni naslov na fus.edu
Ryuhei UeharaJapan Advanced Institute of Science and TechnologyPreverjeni e-poštni naslov na jaist.ac.jp
Klaus JansenProfessor, Computer Science, University of KielPreverjeni e-poštni naslov na informatik.uni-kiel.de
Sun-Yuan HsiehChair Professor of Department of Computer Science and Information Engineering, NationalPreverjeni e-poštni naslov na mail.ncku.edu.tw
Lap Chi LauUniversity of WaterlooPreverjeni e-poštni naslov na cs.uwaterloo.ca
Babak FarzadAssociate Professor of Mathematics, Brock UniversityPreverjeni e-poštni naslov na brocku.ca
Christian KomusiewiczFriedrich-Schiller-Universität JenaPreverjeni e-poštni naslov na uni-jena.de
Stephan OlariuOld Dominion UniversityPreverjeni e-poštni naslov na odu.edu
Ragnar NevriesPhD student, University of Rostock, GermanyPreverjeni e-poštni naslov na uni-rostock.de
Ingo SchiermeyerProfessor für angewandte diskrete MathematikPreverjeni e-poštni naslov na tu-freiberg.de
Zsolt TuzaMTA Rényi Institute, Budapest & University of Pannonia, VeszprémPreverjeni e-poštni naslov na dcs.uni-pannon.hu
Fábio ProttiFull Professor, Fluminense Federal UniversityPreverjeni e-poštni naslov na ic.uff.br

Spremljaj

Van Bang Le

University of Rostock, Germany

Preverjeni e-poštni naslov na uni-rostock.de - Domača stran

Algorithms and Complexity Graph Theory


Naslov Razvrsti po navedbah Razvrsti po letniku Razvrsti po naslovu	Navedeno Navedeno	Leto
Graph Classes: A Survey A Brandstädt, VB Le, JP Spinrad Graph Classes: A Survey. SIAM Monographs on Discrete Mathematics and …, 1999	2481*	1999
The complexity of some problems related to graph 3-colorability A Brandstädt, VB Le, T Szymczak Discrete Applied Mathematics 89 (1), 59-73, 1998	82	1998
Structure and linear time recognition of 3-leaf powers A Brandstädt, VB Le Information Processing Letters 98 (4), 133-138, 2006	67	2006
Tree spanners on chordal graphs: complexity and algorithms A Brandstädt, FF Dragan, HO Le, VB Le Theoretical Computer Science 310 (1), 329-354, 2004	66	2004
Bisplit graphs A Brandstädt, PL Hammer, VB Le, VV Lozin Discrete Mathematics 299 (1), 11-32, 2005	55	2005
Structure and linear-time recognition of 4-leaf powers A Brandstädt, VB Le, R Sritharan ACM Transactions on Algorithms (TALG) 5 (1), 11, 2008	52	2008
On stable cutsets in graphs A Brandstädt, FF Dragan, VB Le, T Szymczak Discrete Applied Mathematics 105 (1), 39-50, 2000	51	2000
Gallai graphs and anti-Gallai graphs VB Le Discrete Mathematics 159 (1-3), 179-189, 1996	47	1996
On the complexity of 4-coloring graphs without long induced paths VB Le, B Randerath, I Schiermeyer Theoretical Computer Science 389 (1), 330-335, 2007	42*	2007
Tree spanners for bipartite graphs and probe interval graphs A Brandstadt, FF Dragan, HO Le, VB Le, R Uehara Algorithmica 47 (1), 27-51, 2007	38*	2007
On stable cutsets in line graphs VB Le, B Randerath Theoretical computer science 301 (1), 463-475, 2003	34*	2003
Stability number of bull-and chair-free graphs revisited A Brandstädt, CT Hoàng, VB Le Discrete Applied Mathematics 131 (1), 39-50, 2003	33	2003
Finding optimal rainbow connection is hard VB Le, Z Tuza preprint, 2009	31	2009
Graph subcolorings: complexity and algorithms J Fiala, K Jansen, VB Le, E Seidel SIAM Journal on Discrete Mathematics 16 (4), 635-650, 2003	31	2003
The square of a block graph VB Le, NN Tuy Discrete Mathematics 310 (4), 734-741, 2010	29*	2010
Splitting a graph into disjoint induced paths or cycles HO Le, VB Le, H Müller Discrete applied mathematics 131 (1), 199-212, 2003	26	2003
On stable cutsets in claw-free graphs and planar graphs VB Le, R Mosca, H Müller Journal of Discrete Algorithms 6 (2), 256-276, 2008	25	2008
Optimal tree 3‐spanners in directed path graphs HO Le, VB Le Networks: An International Journal 34 (2), 81-87, 1999	25	1999
New applications of clique separator decomposition for the Maximum Weight Stable Set problem A Brandstädt, VB Le, S Mahfud Theoretical Computer Science 370 (1), 229-239, 2007	24	2007
Algorithms solving the Matching Cut problem D Kratsch, VB Le Theoretical Computer Science 609, 328-335, 2016	23	2016

Sistem trenutno ne more izvesti postopka. Poskusite znova pozneje.

Članki 1–20

Št. navedb na leto

Podvojene navedbe

Združene navedbe

Dodajanje soavtorjevSoavtorji

Spremljaj

Navedeno

Soavtorji