Result 1 to 20 of 63 total
Cluster editing with locally bounded modifications. (English)
Discrete Appl. Math. 160, No. 15, 2259-2270 (2012).
1
Partitioning into colorful components by minimum edge deletions. (English)
Kärkkäinen, Juha (ed.) et al., Combinatorial pattern matching. 23rd annual symposium, CPM 2012, Helsinki, Finland, July 3‒5, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-31264-9/pbk). Lecture Notes in Computer Science 7354, 56-69 (2012).
2
On making directed graphs transitive. (English)
J. Comput. Syst. Sci. 78, No. 2, 559-574 (2012).
3
On bounded-degree vertex deletion parameterized by treewidth. (English)
Discrete Appl. Math. 160, No. 1-2, 53-60 (2012).
4
Graph-based data clustering with overlaps. (English)
Discrete Optim. 8, No. 1, 2-17 (2011).
5
Editing graphs into disjoint unions of dense clusters. (English)
Algorithmica 61, No. 4, 949-970 (2011).
6
Exploiting bounded signal flow for graph orientation based on cause-effect pairs. (English)
Marchetti-Spaccamela, Alberto (ed.) et al., Theory and practice of algorithms in (computer) systems. First international ICST conference, TAPAS 2011, Rome, Italy, April 18‒20, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-19753-6/pbk). Lecture Notes in Computer Science 6595, 104-115 (2011).
7
Deconstructing intractability-A multivariate complexity analysis of interval constrained coloring. (English)
J. Discrete Algorithms 9, No. 1, 137-151 (2011).
8
Alternative parameterizations for cluster editing. (English)
Černá, Ivana (ed.) et al., SOFSEM 2011: Theory and practice of computer science. 37th conference on current trends in theory and practice of computer science, Nový Smokovec, Slovakia, January 22‒28, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-18380-5/pbk). Lecture Notes in Computer Science 6543, 344-355 (2011).
9
On making a distinguished vertex minimum degree by vertex deletion. (English)
Černá, Ivana (ed.) et al., SOFSEM 2011: Theory and practice of computer science. 37th conference on current trends in theory and practice of computer science, Nový Smokovec, Slovakia, January 22‒28, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-18380-5/pbk). Lecture Notes in Computer Science 6543, 123-134 (2011).
10
Exploiting bounded signal flow for graph orientation based on cause-effect pairs (English)
TAPAS, 104-115 (2011).
11
On making a distinguished vertex minimum degree by vertex deletion (English)
SOFSEM, 123-134 (2011).
12
Alternative parameterizations for cluster editing (English)
SOFSEM, 344-355 (2011).
13
A more relaxed model for graph-based data clustering: $s$-plex cluster editing. (English)
SIAM J. Discrete Math. 24, No. 4, 1662-1683 (2010).
14
Quantum algorithmic methods for computational geometry. (English)
Math. Struct. Comput. Sci. 20, No. 6, 1117-1125 (2010).
15
On tractable cases of target set selection. (English)
Cheong, Otfried (ed.) et al., Algorithms and computation. 21st international symposium, ISAAC 2010, Jeju Island, Korea, December 15‒17, 2010. Proceedings, Part I. Berlin: Springer (ISBN 978-3-642-17516-9/pbk). Lecture Notes in Computer Science 6506, 378-389 (2010).
16
Kernelization and complexity results for connectivity augmentation problems. (English)
Networks 56, No. 2, 131-142 (2010).
17
Extended islands of tractability for parsimony haplotyping. (English)
Amir, Amihood (ed.) et al., Combinatorial pattern matching. 21st annual symposium, CPM 2010, New York, NY, USA, June 21‒23, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-13508-8/pbk). Lecture Notes in Computer Science 6129, 214-226 (2010).
18
Two-layer planarization parameterized by feedback edge set. (English)
Kratochvíl, Jan (ed.) et al., Theory and applications of models of computation. 7th annual conference, TAMC 2010, Prague, Czech Republic, June 7‒11, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-13561-3/pbk). Lecture Notes in Computer Science 6108, 431-442 (2010).
19
Two-layer planarization parameterized by feedback edge set (English)
TAMC, 431-442 (2010).
20
Result 1 to 20 of 63 total
Start
Contact
Print
General Help
