default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMatthias Bentert
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c22]Matthias Bentert, Pål Grønås Drange, Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen:
Two-Sets Cut-Uncut on Planar Graphs. ICALP 2024: 22:1-22:18- [c21]Matthias Bentert, Michael R. Fellows, Petr A. Golovach, Frances A. Rosamond, Saket Saurabh:
Breaking a Graph into Connected Components with Small Dominating Sets. MFCS 2024: 24:1-24:15 - [c20]Matthias Bentert, Alex Crane, Pål Grønås Drange, Felix Reidl, Blair D. Sullivan:
Correlation Clustering with Vertex Splitting. SWAT 2024: 8:1-8:17 - [i28]Matthias Bentert, Alex Crane, Pål Grønås Drange, Felix Reidl, Blair D. Sullivan:
Correlation Clustering with Vertex Splitting. CoRR abs/2402.10335 (2024) - [i27]Matthias Bentert, Fedor V. Fomin, Petr A. Golovach:
Tight Approximation and Kernelization Bounds for Vertex-Disjoint Shortest Paths. CoRR abs/2402.15348 (2024) - [i26]Matthias Bentert, Klaus Heeger, Tomohiro Koana:
Fully Polynomial-time Algorithms Parameterized by Vertex Integrity Using Fast Matrix Multiplication. CoRR abs/2403.01839 (2024) - [i25]Matthias Bentert, Leon Kellerhals, Rolf Niedermeier:
The Structural Complexity Landscape of Finding Balance-Fair Shortest Paths. CoRR abs/2405.18866 (2024) - [i24]Yosuke Mizutani, Daniel Coimbra Salomao, Alex Crane, Matthias Bentert, Pål Grønås Drange, Felix Reidl, Alan Kuntz, Blair D. Sullivan:
Leveraging Fixed-Parameter Tractability for Robot Inspection Planning. CoRR abs/2407.00251 (2024) - [i23]Matthias Bentert, Fedor V. Fomin, Fanny Hauser, Saket Saurabh:
The Parameterized Complexity Landscape of Two-Sets Cut-Uncut. CoRR abs/2408.13543 (2024) - [i22]Matthias Bentert, Daniel Coimbra Salomao, Alex Crane, Yosuke Mizutani
, Felix Reidl, Blair D. Sullivan:
Graph Inspection for Robotic Motion Planning: Do Arithmetic Circuits Help? CoRR abs/2409.08219 (2024) - 2023
- [j17]Matthias Bentert, André Nichterlein:
Parameterized Complexity of Diameter. Algorithmica 85(2): 325-351 (2023) - [j16]Matthias Bentert, Tomohiro Koana, Rolf Niedermeier:
The complexity of gerrymandering over graphs: Paths and trees. Discret. Appl. Math. 324: 103-112 (2023) - [j15]Matthias Bentert, René van Bevern, Till Fluschnik, André Nichterlein, Rolf Niedermeier:
Polynomial-time data reduction for weighted problems beyond additive goal functions. Discret. Appl. Math. 328: 117-133 (2023) - [j14]Matthias Bentert, Niclas Boehmer, Klaus Heeger, Tomohiro Koana:
Stable matching with multilayer approval preferences: Approvals can be harder than strict preferences. Games Econ. Behav. 142: 508-526 (2023) - [j13]Matthias Bentert, Robert Bredereck, Péter Györgyi, Andrzej Kaczmarczyk, Rolf Niedermeier:
A multivariate complexity analysis of the material consumption scheduling problem. J. Sched. 26(4): 369-382 (2023) - [j12]Matthias Bentert, André Nichterlein, Malte Renken, Philipp Zschoche:
Using a Geometric Lens to Find \(\boldsymbol{k}\)-Disjoint Shortest Paths. SIAM J. Discret. Math. 37(3): 1674-1703 (2023) - [c19]Matthias Bentert, Leon Kellerhals, Rolf Niedermeier:
Fair Short Paths in Vertex-Colored Graphs. AAAI 2023: 12346-12354 - [c18]Matthias Bentert, Klaus Heeger, Tomohiro Koana:
Fully Polynomial-Time Algorithms Parameterized by Vertex Integrity Using Fast Matrix Multiplication. ESA 2023: 16:1-16:16 - [c17]Emmanuel Arrighi, Matthias Bentert, Pål Grønås Drange, Blair D. Sullivan, Petra Wolf:
Cluster Editing with Overlapping Communities. IPEC 2023: 2:1-2:12 - [c16]Matthias Bentert, Jannik Schestag, Frank Sommer:
On the Complexity of Finding a Sparse Connected Spanning Subgraph in a Non-Uniform Failure Model. IPEC 2023: 4:1-4:12 - [i21]Matthias Bentert, Pål Grønås Drange, Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen:
Two-sets cut-uncut on planar graphs. CoRR abs/2305.01314 (2023) - [i20]Matthias Bentert, Jannik Schestag, Frank Sommer:
On the Complexity of Finding a Sparse Connected Spanning Subgraph in a non-Uniform Failure Model. CoRR abs/2308.04575 (2023) - 2022
- [j11]Matthias Bentert, René van Bevern, André Nichterlein, Rolf Niedermeier, Pavel V. Smirnov:
Parameterized Algorithms for Power-Efficiently Connecting Wireless Sensor Networks: Theory and Experiments. INFORMS J. Comput. 34(1): 55-75 (2022) - [j10]Matthias Bentert, Klaus Heeger, Dusan Knop:
Length-bounded cuts: Proper interval graphs and structural parameters. J. Comput. Syst. Sci. 126: 21-43 (2022) - [j9]Matthias Bentert, Leon Kellerhals, Rolf Niedermeier:
The structural complexity landscape of finding balance-fair shortest paths. Theor. Comput. Sci. 933: 149-162 (2022) - [c15]Matthias Bentert, Niclas Boehmer, Klaus Heeger, Tomohiro Koana:
Stable Matching with Multilayer Approval Preferences: Approvals Can Be Harder Than Strict Preferences. SAGT 2022: 436-453 - [i19]Matthias Bentert, Leon Kellerhals, Rolf Niedermeier:
Finding Balance-Fair Short Paths in Graphs. CoRR abs/2203.17132 (2022) - [i18]Matthias Bentert, Niclas Boehmer, Maciej Rymar, Henri Tannenberg:
Who won? Winner Determination and Robustness in Liquid Democracy. CoRR abs/2205.05482 (2022) - [i17]Matthias Bentert, Niclas Boehmer, Klaus Heeger, Tomohiro Koana:
Stable Matching with Multilayer Approval Preferences: Approvals can be Harder than Strict Preferences. CoRR abs/2205.07550 (2022) - 2021
- [b1]Matthias Bentert:
Elements of dynamic and 2-SAT programming: paths, trees, and cuts. Technical University of Berlin, Germany, 2021 - [j8]Matthias Bentert, Mathias Weller:
Tree Containment With Soft Polytomies. J. Graph Algorithms Appl. 25(1): 417-436 (2021) - [j7]Matthias Bentert, Roman Haag, Christian Hofer, Tomohiro Koana, André Nichterlein:
Correction to: Parameterized Complexity of Min-Power Asymmetric Connectivity. Theory Comput. Syst. 65(7): 1141-1142 (2021) - [c14]Matthias Bentert, Robert Bredereck, Péter Györgyi, Andrzej Kaczmarczyk, Rolf Niedermeier:
A Multivariate Complexity Analysis of the Material Consumption Scheduling Problem. AAAI 2021: 11755-11763 - [c13]Luis Müller, Matthias Bentert:
On Reachable Assignments in Cycles. ADT 2021: 273-288 - [c12]Matthias Bentert, André Nichterlein, Malte Renken, Philipp Zschoche:
Using a Geometric Lens to Find k Disjoint Shortest Paths. ICALP 2021: 26:1-26:14 - [c11]Matthias Bentert, Tomohiro Koana, Rolf Niedermeier:
The Complexity of Gerrymandering over Graphs: Paths and Trees. WG 2021: 195-206 - [i16]Matthias Bentert, Tomohiro Koana, Rolf Niedermeier:
The Complexity of Gerrymandering Over Graphs: Paths and Trees. CoRR abs/2102.08905 (2021) - [i15]Matthias Bentert, Robert Bredereck, Péter Györgyi, Andrzej Kaczmarczyk, Rolf Niedermeier:
A Multivariate Complexity Analysis of the Material Consumption Scheduling Problem. CoRR abs/2102.13642 (2021) - 2020
- [j6]Matthias Bentert, Anne-Sophie Himmel, André Nichterlein, Rolf Niedermeier:
Efficient computation of optimal temporal walks under waiting-time constraints. Appl. Netw. Sci. 5(1): 73 (2020) - [j5]Matthias Bentert, Alexander Dittmann, Leon Kellerhals, André Nichterlein, Rolf Niedermeier:
An Adaptive Version of Brandes' Algorithm for Betweenness Centrality. J. Graph Algorithms Appl. 24(3): 483-522 (2020) - [j4]Matthias Bentert, Roman Haag, Christian Hofer, Tomohiro Koana, André Nichterlein:
Parameterized Complexity of Min-Power Asymmetric Connectivity. Theory Comput. Syst. 64(7): 1158-1182 (2020) - [c10]Matthias Bentert, Piotr Skowron:
Comparing Election Methods Where Each Voter Ranks Only Few Candidates. AAAI 2020: 2218-2225 - [c9]Matthias Bentert, Klaus Heeger, Dusan Knop:
Length-Bounded Cuts: Proper Interval Graphs and Structural Parameters. ISAAC 2020: 36:1-36:14 - [i14]Luis Müller, Matthias Bentert:
On Reachable Assignments in Cycles and Cliques. CoRR abs/2005.02218 (2020) - [i13]Matthias Bentert, Roman Haag, Christian Hofer, Tomohiro Koana, André Nichterlein:
Parameterized Complexity of Min-Power Asymmetric Connectivity. CoRR abs/2005.14620 (2020) - [i12]Matthias Bentert, André Nichterlein, Malte Renken, Philipp Zschoche:
Using a geometric lens to find k disjoint shortest paths. CoRR abs/2007.12502 (2020)
2010 – 2019
- 2019
- [j3]Matthias Bentert, Till Fluschnik, André Nichterlein, Rolf Niedermeier:
Parameterized aspects of triangle enumeration. J. Comput. Syst. Sci. 103: 61-77 (2019) - [j2]Matthias Bentert, Anne-Sophie Himmel, Hendrik Molter, Marco Morik, Rolf Niedermeier, René Saitenmacher:
Listing All Maximal k-Plexes in Temporal Graphs. ACM J. Exp. Algorithmics 24(1): 1.13:1-1.13:27 (2019) - [j1]Matthias Bentert, René van Bevern, Rolf Niedermeier:
Inductive $$k$$ k -independent graphs and c-colorable subgraphs in scheduling: a review. J. Sched. 22(1): 3-20 (2019) - [c8]Matthias Bentert, André Nichterlein:
Parameterized Complexity of Diameter. CIAC 2019: 50-61 - [c7]Anne-Sophie Himmel, Matthias Bentert, André Nichterlein, Rolf Niedermeier:
Efficient Computation of Optimal Temporal Walks Under Waiting-Time Constraints. COMPLEX NETWORKS (2) 2019: 494-506 - [c6]Matthias Bentert, Roman Haag, Christian Hofer, Tomohiro Koana, André Nichterlein:
Parameterized Complexity of Min-Power Asymmetric Connectivity. IWOCA 2019: 85-96 - [i11]Matthias Bentert, Piotr Skowron:
Comparing Election Methods Where Each Voter Ranks Only Few Candidates. CoRR abs/1901.10848 (2019) - [i10]Matthias Bentert, Jiehua Chen, Vincent Froese, Gerhard J. Woeginger:
Good Things Come to Those Who Swap Objects on Paths. CoRR abs/1905.04219 (2019) - [i9]Anne-Sophie Himmel, Matthias Bentert, André Nichterlein, Rolf Niedermeier:
Efficient Computation of Optimal Temporal Walks under Waiting-Time Constraints. CoRR abs/1909.01152 (2019) - [i8]Matthias Bentert, René van Bevern, Till Fluschnik, André Nichterlein, Rolf Niedermeier:
Polynomial-Time Preprocessing for Weighted Problems Beyond Additive Goal Functions. CoRR abs/1910.00277 (2019) - [i7]Matthias Bentert, Klaus Heeger, Dusan Knop:
Length-Bounded Cuts: Proper Interval Graphs and Structural Parameters. CoRR abs/1910.03409 (2019) - 2018
- [c5]Matthias Bentert, Anne-Sophie Himmel, Hendrik Molter, Marco Morik, Rolf Niedermeier, René Saitenmacher:
Listing All Maximal k-Plexes in Temporal Graphs. ASONAM 2018: 41-46 - [c4]Matthias Bentert, Alexander Dittmann, Leon Kellerhals, André Nichterlein, Rolf Niedermeier:
An Adaptive Version of Brandes' Algorithm for Betweenness Centrality. ISAAC 2018: 36:1-36:13 - [c3]Matthias Bentert, Josef Malík, Mathias Weller:
Tree Containment With Soft Polytomies. SWAT 2018: 9:1-9:14 - [i6]Matthias Bentert, Alexander Dittmann, Leon Kellerhals, André Nichterlein, Rolf Niedermeier:
Towards Improving Brandes' Algorithm for Betweenness Centrality. CoRR abs/1802.06701 (2018) - [i5]Matthias Bentert, André Nichterlein:
Parameterized Complexity of Diameter. CoRR abs/1802.10048 (2018) - [i4]Matthias Bentert, Anne-Sophie Himmel, Hendrik Molter, Marco Morik, Rolf Niedermeier, René Saitenmacher:
Listing All Maximal k-Plexes in Temporal Graphs. CoRR abs/1806.10210 (2018) - 2017
- [c2]Matthias Bentert, René van Bevern, André Nichterlein, Rolf Niedermeier:
Parameterized Algorithms for Power-Efficient Connected Symmetric Wireless Sensor Networks. ALGOSENSORS 2017: 26-40 - [c1]Matthias Bentert, Till Fluschnik, André Nichterlein, Rolf Niedermeier:
Parameterized Aspects of Triangle Enumeration. FCT 2017: 96-110 - [i3]Matthias Bentert, Till Fluschnik, André Nichterlein, Rolf Niedermeier:
Parameterized Aspects of Triangle Enumeration. CoRR abs/1702.06548 (2017) - [i2]Matthias Bentert, René van Bevern, André Nichterlein, Rolf Niedermeier:
Parameterized algorithms for power-efficient connected symmetric wireless sensor networks. CoRR abs/1706.03177 (2017) - [i1]Matthias Bentert, René van Bevern, Rolf Niedermeier:
(Wireless) Scheduling, Graph Classes, and c-Colorable Subgraphs. CoRR abs/1712.06481 (2017)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-16 21:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
