Matthias Bentert

According to our database¹, Matthias Bentert authored at least 38 papers between 2017 and 2024.

Collaborative distances:

Dijkstra number² of four.
Erdős number³ of three.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Links

On csauthors.net:

Bibliography

2024

Tight Approximation and Kernelization Bounds for Vertex-Disjoint Shortest Paths.

[BibT_eX]

[DOI]

Matthias Bentert

Fedor V. Fomin

Petr A. Golovach

CoRR, 2024

Correlation Clustering with Vertex Splitting.

[BibT_eX]

[DOI]

CoRR, 2024

2023

Stable matching with multilayer approval preferences: Approvals can be harder than strict preferences.

[BibT_eX]

[DOI]

Games Econ. Behav., November, 2023

Using a Geometric Lens to Find $\boldsymbol{k}$-Disjoint Shortest Paths.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., September, 2023

A multivariate complexity analysis of the material consumption scheduling problem.

[BibT_eX]

[DOI]

J. Sched., August, 2023

Polynomial-time data reduction for weighted problems beyond additive goal functions.

[BibT_eX]

[DOI]

Discret. Appl. Math., March, 2023

Parameterized Complexity of Diameter.

[BibT_eX]

[DOI]

Matthias Bentert

André Nichterlein

Algorithmica, February, 2023

The complexity of gerrymandering over graphs: Paths and trees.

[BibT_eX]

[DOI]

Matthias Bentert

Tomohiro Koana

Rolf Niedermeier

Discret. Appl. Math., 2023

Two-sets cut-uncut on planar graphs.

[BibT_eX]

[DOI]

CoRR, 2023

On the Complexity of Finding a Sparse Connected Spanning Subgraph in a Non-Uniform Failure Model.

[BibT_eX]

[DOI]

Matthias Bentert

Jannik Schestag

Frank Sommer

Proceedings of the 18th International Symposium on Parameterized and Exact Computation, 2023

Cluster Editing with Overlapping Communities.

[BibT_eX]

[DOI]

Proceedings of the 18th International Symposium on Parameterized and Exact Computation, 2023

Fully Polynomial-Time Algorithms Parameterized by Vertex Integrity Using Fast Matrix Multiplication.

[BibT_eX]

[DOI]

Matthias Bentert

Klaus Heeger

Tomohiro Koana

Proceedings of the 31st Annual European Symposium on Algorithms, 2023

Fair Short Paths in Vertex-Colored Graphs.

[BibT_eX]

[DOI]

Matthias Bentert

Leon Kellerhals

Rolf Niedermeier

Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022

The structural complexity landscape of finding balance-fair shortest paths.

[BibT_eX]

[DOI]

Matthias Bentert

Leon Kellerhals

Rolf Niedermeier

Theor. Comput. Sci., 2022

Length-bounded cuts: Proper interval graphs and structural parameters.

[BibT_eX]

[DOI]

Matthias Bentert

Klaus Heeger

Dusan Knop

J. Comput. Syst. Sci., 2022

Parameterized Algorithms for Power-Efficiently Connecting Wireless Sensor Networks: Theory and Experiments.

[BibT_eX]

[DOI]

INFORMS J. Comput., 2022

Who won? Winner Determination and Robustness in Liquid Democracy.

[BibT_eX]

[DOI]

CoRR, 2022

Finding Balance-Fair Short Paths in Graphs.

[BibT_eX]

[DOI]

Matthias Bentert

Leon Kellerhals

Rolf Niedermeier

CoRR, 2022

2021

Elements of dynamic and 2-SAT programming: paths, trees, and cuts.

[BibT_eX]

[DOI]

Matthias Bentert

PhD thesis, 2021

Correction to: Parameterized Complexity of Min-Power Asymmetric Connectivity.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2021

Tree Containment With Soft Polytomies.

[BibT_eX]

[DOI]

Matthias Bentert

Mathias Weller

J. Graph Algorithms Appl., 2021

Using a Geometric Lens to Find k Disjoint Shortest Paths.

[BibT_eX]

[DOI]

Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

On Reachable Assignments in Cycles.

[BibT_eX]

[DOI]

Luis Müller

Matthias Bentert

Proceedings of the Algorithmic Decision Theory - 7th International Conference, 2021

2020

Parameterized Complexity of Min-Power Asymmetric Connectivity.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2020

An Adaptive Version of Brandes' Algorithm for Betweenness Centrality.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2020

On Reachable Assignments in Cycles and Cliques.

[BibT_eX]

[DOI]

Luis Müller

Matthias Bentert

CoRR, 2020

Efficient computation of optimal temporal walks under waiting-time constraints.

[BibT_eX]

[DOI]

Appl. Netw. Sci., 2020

Comparing Election Methods Where Each Voter Ranks Only Few Candidates.

[BibT_eX]

[DOI]

Matthias Bentert

Piotr Skowron

Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019

Inductive $$k$$ k -independent graphs and c-colorable subgraphs in scheduling: a review.

[BibT_eX]

[DOI]

Matthias Bentert

René van Bevern

Rolf Niedermeier

J. Sched., 2019

Listing All Maximal <i>k</i>-Plexes in Temporal Graphs.

[BibT_eX]

[DOI]

ACM J. Exp. Algorithmics, 2019

Parameterized aspects of triangle enumeration.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2019

Polynomial-Time Preprocessing for Weighted Problems Beyond Additive Goal Functions.

[BibT_eX]

[DOI]

CoRR, 2019

Good Things Come to Those Who Swap Objects on Paths.

[BibT_eX]

[DOI]

CoRR, 2019

2018

Towards Improving Brandes' Algorithm for Betweenness Centrality.

[BibT_eX]

[DOI]

CoRR, 2018

Tree Containment With Soft Polytomies.

[BibT_eX]

[DOI]

Matthias Bentert

Josef Malík

Mathias Weller

Proceedings of the 16th Scandinavian Symposium and Workshops on Algorithm Theory, 2018

Listing All Maximal k-Plexes in Temporal Graphs.

[BibT_eX]

[DOI]

Proceedings of the IEEE/ACM 2018 International Conference on Advances in Social Networks Analysis and Mining, 2018

2017

(Wireless) Scheduling, Graph Classes, and c-Colorable Subgraphs.

[BibT_eX]

[DOI]

Matthias Bentert

René van Bevern

Rolf Niedermeier

CoRR, 2017

Parameterized Algorithms for Power-Efficient Connected Symmetric Wireless Sensor Networks.

[BibT_eX]

[DOI]

Proceedings of the Algorithms for Sensor Systems, 2017

Matthias Bentert

Timeline

Legend:

Links

On csauthors.net:

Bibliography

Loading...