The following pages link to Christian Komusiewicz (Q329036):
Displaying 50 items.
- \(\mathrm{H}\)-index manipulation by merging articles: models, theory, and experiments (Q329039) (← links)
- On making directed graphs transitive (Q414917) (← links)
- An analytical approach to network motif detection in samples of networks with pairwise different vertex labels (Q428318) (← links)
- Graph-based data clustering with overlaps (Q456688) (← links)
- Parameterized complexity of critical node cuts (Q517024) (← links)
- Deconstructing intractability-A multivariate complexity analysis of interval constrained coloring (Q533417) (← links)
- Editing graphs into disjoint unions of dense clusters (Q652530) (← links)
- Cluster editing with locally bounded modifications (Q713321) (← links)
- Average parameterization and partial kernelization for computing medians (Q716309) (← links)
- Sorting by multi-cut rearrangements (Q831850) (← links)
- Isolation concepts for efficiently enumerating dense subgraphs (Q837155) (← links)
- Fixed-parameter algorithms for cluster vertex deletion (Q987386) (← links)
- Isolation concepts for clique enumeration: comparison and computational experiments (Q1040581) (← links)
- Parameterizing edge modification problems above lower bounds (Q1635817) (← links)
- Parameterized algorithms for recognizing monopolar and 2-subcolorable graphs (Q1678166) (← links)
- Exact algorithms for finding well-connected 2-clubs in sparse real-world graphs: theory and experiments (Q1719617) (← links)
- The parameterized complexity of the rainbow subgraph problem (Q1736640) (← links)
- Finding supported paths in heterogeneous networks (Q1736715) (← links)
- Multivariate algorithmics for finding cohesive subnetworks (Q1736776) (← links)
- Parameterized computational complexity of finding small-diameter subgraphs (Q1758028) (← links)
- On the parameterized complexity of consensus clustering (Q2015135) (← links)
- Refined parameterizations for computing colored cuts in edge-colored graphs (Q2082563) (← links)
- Colored cut games (Q2087453) (← links)
- The parameterized complexity of \(s\)-club with triangle and seed constraints (Q2169965) (← links)
- On critical node problems with vulnerable vertices (Q2169985) (← links)
- Destroying bicolored \(P_3\)s by deleting few edges (Q2179362) (← links)
- Matching cut: kernelization, single-exponential time FPT, and exact exponential algorithms (Q2192064) (← links)
- Revisiting the parameterized complexity of maximum-duo preservation string mapping (Q2210511) (← links)
- Refined notions of parameterized enumeration kernels with applications to matching cut enumeration (Q2237892) (← links)
- On explaining integer vectors by few homogeneous segments (Q2256725) (← links)
- On structural parameterizations for the 2-club problem (Q2341718) (← links)
- Towards an algorithmic guide to Spiral Galaxies (Q2347000) (← links)
- An algorithmic framework for fixed-cardinality optimization in sparse graphs applied to dense subgraph problems (Q2354725) (← links)
- Local search for string problems: brute-force is essentially optimal (Q2437744) (← links)
- A cubic-vertex kernel for flip consensus tree (Q2441594) (← links)
- (Prefix) reversal distance for (signed) strings with few blocks or small alphabets (Q2628806) (← links)
- Preventing small \(\mathbf{(s,t)} \)-cuts by protecting edges (Q2672432) (← links)
- Can local optimality be used for efficient data reduction? (Q2692734) (← links)
- Parameterized Algorithmics for Graph Modification Problems: On Interactions with Heuristics (Q2827798) (← links)
- On generating triangle-free graphs (Q2839211) (← links)
- On Explaining Integer Vectors by Few Homogenous Segments (Q2842158) (← links)
- Effective and Efficient Data Reduction for the Subset Interconnection Design Problem (Q2872100) (← links)
- Partitioning into Colorful Components by Minimum Edge Deletions (Q2904478) (← links)
- New Races in Parameterized Algorithmics (Q2912706) (← links)
- The Parameterized Complexity of the Rainbow Subgraph Problem (Q2945198) (← links)
- Twins in Subdivision Drawings of Hypergraphs (Q2961505) (← links)
- A More Relaxed Model for Graph-Based Data Clustering: <i>s</i>-Plex Cluster Editing (Q3013154) (← links)
- Measuring Indifference: Unit Interval Vertex Deletion (Q3057628) (← links)
- Alternative Parameterizations for Cluster Editing (Q3075528) (← links)
- On the Parameterized Complexity of Consensus Clustering (Q3104664) (← links)
