Travelled to:1 × Italy
1 × Japan
1 × Spain
2 × USA
Collaborated with:L.Gargano D.G.Kirkpatrick S.Perennes L.Stacho U.Vaccaro T.Feder S.Klein R.Motwani V.Dalmau L.Egri B.Larose A.Rafiey
Talks about:problem (3) complex (2) tree (2) dichotomi (1) descript (1) symmetr (1) logspac (1) general (1) complet (1) vertic (1)
Person: Pavol Hell
DBLP: Hell:Pavol
Contributed to:
2015
2002
199919971978Wrote 5 papers:
- LICS-2015-DalmauEHLR #complexity #problem
- Descriptive Complexity of List H-Coloring Problems in Logspace: A Refined Dichotomy (VD, LE, PH, BL, AR), pp. 487–498.
- ICALP-2002-GarganoHSV #bound #branch
- Spanning Trees with Bounded Number of Branch Vertices (LG, PH, LS, UV), pp. 355–365.
- STOC-1999-FederHKM #complexity #graph #problem
- Complexity of Graph Partition Problems (TF, PH, SK, RM), pp. 464–472.
- ICALP-1997-GarganoHP #symmetry
- Colouring Paths in Directed Symmetric Trees with Applications to WDM Routing (LG, PH, SP), pp. 505–515.
- STOC-1978-KirkpatrickH #on the #problem
- On the Completeness of a Generalized Matching Problem (DGK, PH), pp. 240–245.