Result 1 to 20 of 71 total
Well quasi orders in subclasses of bounded treewidth graphs and their algorithmic applications. (English)
Algorithmica 64, No. 1, 3-18 (2012).
1
Optimization problems in dotted interval graphs. (English)
Golumbic, Martin Charles (ed.) et al., Graph-theoretic concepts in computer science. 38th international workshop, WG 2012, Jerusalem, Israel, June 26‒28, 2012. Revised selcted papers. Berlin: Springer (ISBN 978-3-642-34610-1/pbk). Lecture Notes in Computer Science 7551, 46-56 (2012).
2
Parameterized complexity of induced $H$-matching on claw-free graphs. (English)
Epstein, Leah (ed.) et al., Algorithms ‒ ESA 2012. 20th annual European symposium, Ljubljana, Slovenia, September 10‒12, 2012. Proceeding. Berlin: Springer (ISBN 978-3-642-33089-6/pbk). Lecture Notes in Computer Science 7501, 624-635 (2012).
3
Mod/Resc parsimony inference: theory and application. (English)
Inf. Comput. 213, 23-32 (2012).
4
Treewidth governs the complexity of target set selection. (English)
Discrete Optim. 8, No. 1, 87-96 (2011).
5
Parameterized two-player Nash equilibrium. (English)
Kolman, Petr (ed.) et al., Graph-theoretic concepts in computer science. 37th international workshop, WG 2011, Teplá Monastery, Czech Republic, June 21‒24, 2011. Revised papers. Berlin: Springer (ISBN 978-3-642-25869-5/pbk). Lecture Notes in Computer Science 6986, 215-226 (2011).
6
Minimum vertex cover in rectangle graphs. (English)
Comput. Geom. 44, No. 6-7, 356-364 (2011).
7
Weak compositions and their applications to polynomial lower-bounds for kernelization. (English)
Electron. Colloq. Comput. Complex. 18, 72 (2011).
8
Distance oracles for vertex-labeled graphs. (English)
Aceto, Luca (ed.) et al., Automata, languages and programming. 38th international colloquium, ICALP 2011, Zurich, Switzerland, July 4‒8, 2011. Proceedings, Part II. Berlin: Springer (ISBN 978-3-642-22011-1/pbk). Lecture Notes in Computer Science 6756, 490-501 (2011).
9
Domination when the stars are out. (English)
Aceto, Luca (ed.) et al., Automata, languages and programming. 38th international colloquium, ICALP 2011, Zurich, Switzerland, July 4‒8, 2011. Proceedings, Part I. Berlin: Springer (ISBN 978-3-642-22005-0/pbk). Lecture Notes in Computer Science 6755, 462-473 (2011).
10
Upper and lower bounds for finding connected motifs in vertex-colored graphs. (English)
J. Comput. Syst. Sci. 77, No. 4, 799-811 (2011).
11
Optimization problems in multiple subtree graphs. (English)
Discrete Appl. Math. 159, No. 7, 588-594 (2011).
12
Haplotype inference constrained by plausible haplotype data (English)
IEEE/ACM Trans. Comput. Biology Bioinform. 8, No. 6, 1692-1699 (2011).
13
Parameterized two-player Nash equilibrium (English)
WG, 215-226 (2011).
14
Constraint satisfaction problems: convexity makes alldifferent constraints tractable (English)
IJCAI, 522-527 (2011).
15
Domination when the stars are out (English)
ICALP (1), 462-473 (2011).
16
Distance oracles for vertex-labeled graphs (English)
ICALP (2), 490-501 (2011).
17
An extension of the Nemhauser-Trotter theorem to generalized vertex cover with applications. (English)
SIAM J. Discrete Math. 24, No. 1, 287-300 (2010).
18
Restricted LCS. (English)
Chavez, Edgar (ed.) et al., String processing and information retrieval. 17th international symposium, SPIRE 2010, Los Cabos, Mexico, October 11‒13, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-16320-3/pbk). Lecture Notes in Computer Science 6393, 250-257 (2010).
19
Minimum vertex cover in rectangle graphs. (English)
de Berg, Mark (ed.) et al., Algorithms ‒ ESA 2010. 18th annual European symposium, Liverpool, UK, September 6‒8, 2010. Proceedings, Part I. Berlin: Springer (ISBN 978-3-642-15774-5/pbk). Lecture Notes in Computer Science 6346, 255-266 (2010).
20
Result 1 to 20 of 71 total
Start
Contact
Print
General Help
