Christian Komusiewicz

Christian Komusiewicz

Philipps-Universität Marburg

H-index: 29

Europe-Germany

Contact Christian Komusiewicz

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

Destroying multicolored paths and cycles in edge-colored graphs

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

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

A Graph-Theoretic Formulation of Exploratory Blockmodeling

On the group coverage centrality problem: Parameterized complexity and heuristics

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

Exact algorithms for group closeness centrality

Christian Komusiewicz Information

University	Philipps-Universität Marburg
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	Access 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

On the complexity of community-aware network sparsification

arXiv preprint arXiv:2402.15494

2024/2/23

Christian Komusiewicz

H-Index: 21

Nils Morawietz

H-Index: 2

Frank Sommer

H-Index: 3

Destroying multicolored paths and cycles in edge-colored graphs

Discrete Mathematics & Theoretical Computer Science

2023/3/3

Niels Grüttemeier

H-Index: 3

Christian Komusiewicz

H-Index: 21

Frank Sommer

H-Index: 3

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

Data Mining and Knowledge Discovery

2023/3

Christian Komusiewicz

H-Index: 21

Bernhard Seeger

H-Index: 21

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

2023

Christian Komusiewicz

H-Index: 21

Nils Morawietz

H-Index: 2

Bernhard Seeger

H-Index: 21

A Graph-Theoretic Formulation of Exploratory Blockmodeling

2023

Niels Grüttemeier

H-Index: 3

Christian Komusiewicz

H-Index: 21

Nils Morawietz

H-Index: 2

On the group coverage centrality problem: Parameterized complexity and heuristics

2023

Christian Komusiewicz

H-Index: 21

Frank Sommer

H-Index: 3

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

2023

Christian Komusiewicz

H-Index: 21

Simone Linz

H-Index: 11

Nils Morawietz

H-Index: 2

Exact algorithms for group closeness centrality

2023

Christian Komusiewicz

H-Index: 21

Nils Morawietz

H-Index: 2

Frank Sommer

H-Index: 3

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

2023

Christian Komusiewicz

H-Index: 21

Bernhard Seeger

H-Index: 21

Parameterized local search for max c-cut

2023/8/19

Niels Grüttemeier

H-Index: 3

Christian Komusiewicz

H-Index: 21

Nils Morawietz

H-Index: 2

On computing optimal tree ensembles

2023/7/3

Christian Komusiewicz

H-Index: 21

Frank Sommer

H-Index: 3

Manuel Sorge

H-Index: 13

Computing dense and sparse subgraphs of weakly closed graphs

Algorithmica

2023/7

Tomohiro Koana

H-Index: 3

Christian Komusiewicz

H-Index: 21

Frank Sommer

H-Index: 3

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

2023/6/20

Christian Komusiewicz

H-Index: 21

Essentially tight kernels for (weakly) closed graphs

Algorithmica

2023/6

Tomohiro Koana

H-Index: 3

Christian Komusiewicz

H-Index: 21

Frank Sommer

H-Index: 3

Colored cut games

Theoretical Computer Science

2022/11/10

Nils Morawietz

H-Index: 2

Niels Grüttemeier

H-Index: 3

Christian Komusiewicz

H-Index: 21

Frank Sommer

H-Index: 3

Efficient Branch-and-Bound Algorithms for Finding Triangle-Constrained 2-Clubs

arXiv preprint arXiv:2211.01701

2022/11/3

Niels Grüttemeier

H-Index: 3

Christian Komusiewicz

H-Index: 21

Frank Sommer

H-Index: 3

Refined parameterizations for computing colored cuts in edge-colored graphs

Theory of Computing Systems

2022/10

Nils Morawietz

H-Index: 2

Niels Grüttemeier

H-Index: 3

Christian Komusiewicz

H-Index: 21

Frank Sommer

H-Index: 3

Learning Bayesian networks under sparsity constraints: A parameterized complexity analysis

Journal of Artificial Intelligence Research

2022/7/10

Niels Grüttemeier

H-Index: 3

Christian Komusiewicz

H-Index: 21

On Critical Node Problems with Vulnerable Vertices

2022/5/29

Niels Grüttemeier

H-Index: 3

Christian Komusiewicz

H-Index: 21

Frank Sommer

H-Index: 3

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

Journal of Computer and System Sciences

2022/2/1

Christian Komusiewicz

H-Index: 21

Dieter Kratsch

H-Index: 22

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

Co-Authors

H-index: 65

Michael Fellows — Michael Fellows
Universitetet i Bergen

Visit Michael Fellows Page

H-index: 34

Frances rosamond — Frances rosamond
Universitetet i Bergen

Visit Frances rosamond Page

H-index: 31

Guillaume Fertin — Guillaume Fertin
Université de Nantes

Visit Guillaume Fertin Page

H-index: 25

Robert Bredereck — Robert Bredereck
Humboldt-Universität zu Berlin

Visit Robert Bredereck Page

H-index: 21

André Nichterlein — André Nichterlein
Technische Universität Berlin

Visit André Nichterlein Page

H-index: 21

René van Bevern — René van Bevern
Novosibirsk State University

Visit René van Bevern Page

1
2
3

academic-engine

Useful Links

List of top 50 universities

List of top 100 universities

List of top 500 universities

Find Professors Email

Find Universities Email

CUFinder Academic Engine