Christian Komusiewicz

Christian Komusiewicz

Philipps-Universität Marburg

H-index: 29

Europe-Germany

About Christian Komusiewicz

Christian Komusiewicz, With an exceptional h-index of 29 and a recent h-index of 19 (since 2020), a distinguished researcher at Philipps-Universität Marburg, specializes in the field of Algorithms, Algorithm Engineering, Parameterized Complexity, Computational Biology.

His recent articles reflect a diverse array of research interests and contributions to the field:

On the complexity of community-aware network sparsification

On computing optimal tree ensembles

On computing exact means of time series using the move-split-merge metric

Exact algorithms for group closeness centrality

Computing dense and sparse subgraphs of weakly closed graphs

On the Complexity of Computing Time Series Medians Under the Move-Split-Merge Metric

Exact and heuristic approaches to speeding up the MSM time series distance computation

A multivariate complexity analysis of the generalized Noah’s ark problem

Christian Komusiewicz Information

University

Position

___

Citations(all)

2372

Citations(since 2020)

1142

Cited By

1778

hIndex(all)

29

hIndex(since 2020)

19

i10Index(all)

55

i10Index(since 2020)

40

Email

University Profile Page

Philipps-Universität Marburg

Google Scholar

View Google Scholar Profile

Christian Komusiewicz Skills & Research Interests

Algorithms

Algorithm Engineering

Parameterized Complexity

Computational Biology

Top articles of Christian Komusiewicz

Title

Journal

Author(s)

Publication Date

On the complexity of community-aware network sparsification

arXiv preprint arXiv:2402.15494

Emanuel Herrendorf

Christian Komusiewicz

Nils Morawietz

Frank Sommer

2024/2/23

On computing optimal tree ensembles

Christian Komusiewicz

Pascal Kunz

Frank Sommer

Manuel Sorge

2023/7/3

On computing exact means of time series using the move-split-merge metric

Data Mining and Knowledge Discovery

Jana Holznigenkemper

Christian Komusiewicz

Bernhard Seeger

2023/3

Exact algorithms for group closeness centrality

Luca Pascal Staus

Christian Komusiewicz

Nils Morawietz

Frank Sommer

2023

Computing dense and sparse subgraphs of weakly closed graphs

Algorithmica

Tomohiro Koana

Christian Komusiewicz

Frank Sommer

2023/7

On the Complexity of Computing Time Series Medians Under the Move-Split-Merge Metric

Jana Holznigenkemper

Christian Komusiewicz

Nils Morawietz

Bernhard Seeger

2023

Exact and heuristic approaches to speeding up the MSM time series distance computation

Jana Holznigenkemper

Christian Komusiewicz

Bernhard Seeger

2023

A multivariate complexity analysis of the generalized Noah’s ark problem

Christian Komusiewicz

Jannik T Schestag

2023/6/20

A Graph-Theoretic Formulation of Exploratory Blockmodeling

Alexander Bille

Niels Grüttemeier

Christian Komusiewicz

Nils Morawietz

2023

Essentially tight kernels for (weakly) closed graphs

Algorithmica

Tomohiro Koana

Christian Komusiewicz

Frank Sommer

2023/6

On the group coverage centrality problem: Parameterized complexity and heuristics

Christian Komusiewicz

Jannis Schramek

Frank Sommer

2023

Parameterized local search for max c-cut

Jaroslav Garvardt

Niels Grüttemeier

Christian Komusiewicz

Nils Morawietz

2023/8/19

Destroying multicolored paths and cycles in edge-colored graphs

Discrete Mathematics & Theoretical Computer Science

Nils Jakob Eckstein

Niels Grüttemeier

Christian Komusiewicz

Frank Sommer

2023/3/3

On the complexity of parameterized local search for the maximum parsimony problem

Christian Komusiewicz

Simone Linz

Nils Morawietz

Jannik Schestag

2023

Finding 3-swap-optimal independent sets and dominating sets is hard

Christian Komusiewicz

Nils Morawietz

2022

Learning Bayesian networks under sparsity constraints: A parameterized complexity analysis

Journal of Artificial Intelligence Research

Niels Grüttemeier

Christian Komusiewicz

2022/7/10

The Parameterized Complexity of s-Club with Triangle and Seed Constraints

Jaroslav Garvardt

Christian Komusiewicz

Frank Sommer

2022

On Critical Node Problems with Vulnerable Vertices

Jannik Schestag

Niels Grüttemeier

Christian Komusiewicz

Frank Sommer

2022/5/29

Exploiting -Closure in Kernelization Algorithms for Graph Problems

SIAM Journal on Discrete Mathematics

Tomohiro Koana

Christian Komusiewicz

Frank Sommer

2022

Refined notions of parameterized enumeration kernels with applications to matching cut enumeration

Journal of Computer and System Sciences

Petr A Golovach

Christian Komusiewicz

Dieter Kratsch

2022/2/1

See List of Professors in Christian Komusiewicz University(Philipps-Universität Marburg)

Co-Authors

H-index: 65
Michael Fellows

Michael Fellows

Universitetet i Bergen

H-index: 34
Frances rosamond

Frances rosamond

Universitetet i Bergen

H-index: 31
Guillaume Fertin

Guillaume Fertin

Université de Nantes

H-index: 25
Robert Bredereck

Robert Bredereck

Humboldt-Universität zu Berlin

H-index: 21
André Nichterlein

André Nichterlein

Technische Universität Berlin

H-index: 21
René van Bevern

René van Bevern

Novosibirsk State University

academic-engine