Obserwuj
Christian Komusiewicz
Tytuł
Cytowane przez
Cytowane przez
Rok
Fixed-parameter algorithms for cluster vertex deletion
F Hüffner, C Komusiewicz, H Moser, R Niedermeier
Theory of Computing Systems 47 (1), 196-217, 2010
1642010
Cluster editing with locally bounded modifications
C Komusiewicz, J Uhlmann
Discrete Applied Mathematics 160 (15), 2259-2270, 2012
1342012
Graph-based data clustering with overlaps
MR Fellows, J Guo, C Komusiewicz, R Niedermeier, J Uhlmann
Discrete Optimization 8 (1), 2-17, 2011
1162011
The PACE 2017 parameterized algorithms and computational experiments challenge: The second iteration
H Dell, C Komusiewicz, N Talmon, M Weller
12th international symposium on parameterized and exact computation (IPEC …, 2018
1152018
A more relaxed model for graph-based data clustering: s-plex cluster editing
J Guo, C Komusiewicz, R Niedermeier, J Uhlmann
SIAM Journal on Discrete Mathematics 24 (4), 1662-1683, 2010
84*2010
Parameterized computational complexity of finding small-diameter subgraphs
A Schäfer, C Komusiewicz, H Moser, R Niedermeier
Optimization Letters 6 (5), 883-891, 2012
822012
Isolation concepts for efficiently enumerating dense subgraphs
C Komusiewicz, F Hüffner, H Moser, R Niedermeier
Theoretical Computer Science 410 (38), 3640-3654, 2009
79*2009
Parameterized algorithmics for finding connected motifs in biological networks
N Betzler, R Van Bevern, M Fellows, C Komusiewicz, R Niedermeier
Computational Biology and Bioinformatics, IEEE/ACM Transactions on, 1-1, 2011
722011
The first parameterized algorithms and computational experiments challenge
H Dell, T Husfeldt, BMP Jansen, P Kaski, C Komusiewicz, FA Rosamond
International Symposium on Parameterized and Exact Computation, 1-9, 2017
682017
New Races in Parameterized Algorithmics
C Komusiewicz, R Niedermeier
MFCS 12, 19-30, 2012
632012
Parameterized Algorithmics and Computational Experiments for Finding 2-Clubs
S Hartung, C Komusiewicz, A Nichterlein
Journal of Graph Algorithms and Applications, 2015
582015
Multivariate algorithmics for finding cohesive subnetworks
C Komusiewicz
Algorithms 9 (1), 21, 2016
562016
An algorithmic framework for fixed-cardinality optimization in sparse graphs applied to dense subgraph problems
C Komusiewicz, M Sorge
Discrete Applied Mathematics 193, 145-161, 2015
54*2015
Average parameterization and partial kernelization for computing medians
N Betzler, J Guo, C Komusiewicz, R Niedermeier
Journal of Computer and System Sciences 77 (4), 774-789, 2011
542011
Improved algorithms for bicluster editing
J Guo, F Hüffner, C Komusiewicz, Y Zhang
Theory and Applications of Models of Computation, 445-456, 2008
542008
Parameterized algorithms and hardness results for some graph motif problems
N Betzler, M Fellows, C Komusiewicz, R Niedermeier
Combinatorial Pattern Matching, 31-43, 2008
532008
On generating triangle-free graphs
D Brügmann, C Komusiewicz, H Moser
Electronic Notes in Discrete Mathematics 32, 51-58, 2009
512009
Multivariate algorithmics for NP-hard string problems
L Bulteau, F Hüffner, C Komusiewicz, R Niedermeier
Bulletin-European Association for Theoretical Computer Science 114, 2014
502014
Precedence-constrained scheduling problems parameterized by partial order width
R Van Bevern, R Bredereck, L Bulteau, C Komusiewicz, N Talmon, ...
International conference on discrete optimization and operations research …, 2016
492016
Deconstructing intractability--A multivariate complexity analysis of interval constrained coloring
C Komusiewicz, R Niedermeier, J Uhlmann
Journal of Discrete Algorithms 9 (1), 137-151, 2011
43*2011
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20