BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Denmark
1 × Iceland
1 × Latvia
1 × Portugal
1 × United Kingdom
Collaborated with:
F.V.Fomin J.Fiala J.Kratochvíl F.F.Dragan P.Heggernes D.Kratsch Y.Villanger J.Nederlof M.Pilipczuk M.Basavaraju P.Misra M.S.Ramanujan S.Saurabh
Talks about:
constrain (2) algorithm (2) distanc (2) minim (2) label (2) graph (2) treewidth (1) parameter (1) multicast (1) increment (1)

Person: Petr A. Golovach

DBLP DBLP: Golovach:Petr_A=

Contributed to:

ICALP (1) 20142014
ICALP (1) 20132013
ICALP (2) 20122012
ICALP (1) 20082008
ICALP 20052005

Wrote 6 papers:

ICALP-v1-2014-BasavarajuFGMRS #algorithm
Parameterized Algorithms to Preserve Connectivity (MB, FVF, PAG, PM, MSR, SS), pp. 800–811.
ICALP-v1-2013-GolovachHKV #algorithm #incremental #polynomial #set
An Incremental Polynomial Time Algorithm to Enumerate All Minimal Edge Dominating Sets (PAG, PH, DK, YV), pp. 485–496.
ICALP-v2-2012-FominGNP #game studies #multi
Minimizing Rosenthal Potential in Multicast Games (FVF, PAG, JN, MP), pp. 525–536.
ICALP-A-2008-DraganFG #graph
Spanners in Sparse Graphs (FFD, FVF, PAG), pp. 597–608.
ICALP-A-2008-FialaGK #complexity #distance #problem
Computational Complexity of the Distance Constrained Labeling Problem for Trees (JF, PAG, JK), pp. 294–305.
ICALP-2005-FialaGK #bound #distance #graph
Distance Constrained Labelings of Graphs of Bounded Treewidth (JF, PAG, JK), pp. 360–372.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.