I agree that this site is using cookies. You can find further informations here.
X
Komusiewicz, J.
12  results:
Bookchapter (Online) X
Search for persons X
?
1

A Multivariate Complexity Analysis of the Generalized Noah'..:

, In: AIRO Springer Series; Graphs and Combinatorial Optimization: from Theory to Applications,
Komusiewicz, Christian ; Schestag, Jannik T. - p. 109-121 , 2024
Link: https://doi.org/10.1007/..
 
?
2

On Critical Node Problems with Vulnerable Vertices:

, In: Lecture Notes in Computer Science; Combinatorial Algorithms,
Schestag, Jannik ; Grüttemeier, Niels ; Komusiewicz, Christian. - p. 494-508 , 2022
Link: https://doi.org/10.1007/..
 
?
3

The Parameterized Complexity of s-Club with Triangle and Se..:

, In: Lecture Notes in Computer Science; Combinatorial Algorithms,
Garvardt, Jaroslav ; Komusiewicz, Christian ; Sommer, Frank - p. 313-326 , 2022
Link: https://doi.org/10.1007/..
 
?
4

Preventing Small $$\mathbf {(s,t)}$$-Cuts by Protecting Edg..:

, In: Graph-Theoretic Concepts in Computer Science; Lecture Notes in Computer Science,
Grüttemeier, Niels ; Komusiewicz, Christian ; Morawietz, Nils. - p. 143-155 , 2021
Link: https://doi.org/10.1007/..
 
?
5

Sorting by Multi-cut Rearrangements:

, In: SOFSEM 2021: Theory and Practice of Computer Science; Lecture Notes in Computer Science,
Bulteau, Laurent ; Fertin, Guillaume ; Jean, Géraldine. - p. 593-607 , 2021
Link: https://doi.org/10.1007/..
 
?
6

Can Local Optimality Be Used for Efficient Data Reduction?:

, In: Lecture Notes in Computer Science; Algorithms and Complexity,
Komusiewicz, Christian ; Morawietz, Nils - p. 354-366 , 2021
Link: https://doi.org/10.1007/..
 
?
7

Refined Parameterizations for Computing Colored Cuts in Edg..:

, In: SOFSEM 2020: Theory and Practice of Computer Science; Lecture Notes in Computer Science,
Morawietz, Nils ; Grüttemeier, Niels ; Komusiewicz, Christian. - p. 248-259 , 2020
Link: https://doi.org/10.1007/..
 
?
8

Your Rugby Mates Don't Need to Know Your Colleagues: Triadi..:

, In: Lecture Notes in Computer Science; Algorithms and Complexity,
Bulteau, Laurent ; Grüttemeier, Niels ; Komusiewicz, Christian. - p. 99-111 , 2019
Link: https://doi.org/10.1007/..
 
?
9

Enumerating Connected Induced Subgraphs: Improved Delay and..:

, In: SOFSEM 2019: Theory and Practice of Computer Science; Lecture Notes in Computer Science,
Komusiewicz, Christian ; Sommer, Frank - p. 272-284 , 2019
Link: https://doi.org/10.1007/..
 
?
10

Destroying Bicolored $$P_3$$s by Deleting Few Edges:

, In: Computing with Foresight and Industry; Lecture Notes in Computer Science,
Grüttemeier, Niels ; Komusiewicz, Christian ; Schestag, Jannik. - p. 193-204 , 2019
Link: https://doi.org/10.1007/..
 
?
11

On the Relation of Strong Triadic Closure and Cluster Delet..:

, In: Graph-Theoretic Concepts in Computer Science; Lecture Notes in Computer Science,
Grüttemeier, Niels ; Komusiewicz, Christian - p. 239-251 , 2018
Link: https://doi.org/10.1007/..
 
?
12

Minimum common string partition parameterized by partition ..:

, In: Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete algorithms,
Bulteau, Laurent ; Komusiewicz, Christian - p. 102-121 , 2014
Link: https://dl.acm.org/doi/1..
 
1-12