default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMoritz Mühlenthaler
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i17]Valentin Bartier, Nicolas Bousquet, Moritz Mühlenthaler:
Independent set reconfiguration in H-free graphs. CoRR abs/2402.03063 (2024)- [i16]Daniel W. Cranston, Moritz Mühlenthaler, Benjamin Peyrille:
A simple quadratic kernel for Token Jumping on surfaces. CoRR abs/2408.04743 (2024) - [i15]Moritz Mühlenthaler, Mark H. Siggers, Thomas Suzan:
Reconfiguring homomorphisms to reflexive graphs via a simple reduction. CoRR abs/2410.12687 (2024) - 2023
- [j8]Tatsuhiko Hatanaka, Felix Hommelsheim, Takehiro Ito, Yusuke Kobayashi, Moritz Mühlenthaler, Akira Suzuki:
Fixed-parameter algorithms for graph constraint logic. Theor. Comput. Sci. 959: 113863 (2023) - [j7]Nicolas Bousquet, Felix Hommelsheim, Yusuke Kobayashi
, Moritz Mühlenthaler, Akira Suzuki:
Feedback vertex set reconfiguration in planar graphs. Theor. Comput. Sci. 979: 114188 (2023) - [c17]Antoine Méot, Arnaud de Mesmay, Moritz Mühlenthaler, Alantha Newman:
Voting algorithms for unique games on complete graphs. SOSA 2023: 124-136 - [c16]Benjamin Lévêque, Moritz Mühlenthaler, Thomas Suzan:
Reconfiguration of Digraph Homomorphisms. STACS 2023: 43:1-43:21 - [i14]Moritz Mühlenthaler, Benjamin Peyrille, Zoltán Szigeti:
Directed hypergraph connectivity augmentation by hyperarc reorientations. CoRR abs/2304.14868 (2023) - 2022
- [j6]David Adjiashvili, Felix Hommelsheim, Moritz Mühlenthaler:
Flexible Graph Connectivity. Math. Program. 192(1): 409-441 (2022) - [j5]Moritz Mühlenthaler, Alexander Raß, Manuel Schmitt, Rolf Wanka:
Exact Markov chain-based runtime analysis of a discrete particle swarm optimization algorithm on sorting and OneMax. Nat. Comput. 21(4): 651-677 (2022) - [c15]David Adjiashvili, Felix Hommelsheim, Moritz Mühlenthaler, Oliver Schaudt:
Fault-Tolerant Edge-Disjoint s-t Paths - Beyond Uniform Faults. SWAT 2022: 5:1-5:19 - [i13]Benjamin Lévêque, Moritz Mühlenthaler, Thomas Suzan:
Reconfiguration of Digraph Homomorphisms. CoRR abs/2205.09210 (2022) - 2021
- [j4]Felix Hommelsheim, Moritz Mühlenthaler, Oliver Schaudt:
How to Secure Matchings against Edge Failures. SIAM J. Discret. Math. 35(3): 2265-2292 (2021) - [i12]Antoine Méot, Arnaud de Mesmay, Moritz Mühlenthaler, Alantha Newman:
Voting algorithms for unique games on complete graphs. CoRR abs/2110.11851 (2021) - 2020
- [j3]Marthe Bonamy, Marc Heinrich, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Moritz Mühlenthaler, Akira Suzuki, Kunihiro Wasa:
Diameter of colorings under Kempe changes. Theor. Comput. Sci. 838: 45-57 (2020) - [c14]David Adjiashvili, Felix Hommelsheim, Moritz Mühlenthaler:
Flexible Graph Connectivity. IPCO 2020: 13-26 - [c13]Tatsuhiko Hatanaka, Felix Hommelsheim, Takehiro Ito, Yusuke Kobayashi, Moritz Mühlenthaler, Akira Suzuki:
Fixed-Parameter Algorithms for Graph Constraint Logic. IPEC 2020: 15:1-15:15 - [c12]Marthe Bonamy, Marc Heinrich, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Moritz Mühlenthaler, Akira Suzuki, Kunihiro Wasa:
Shortest Reconfiguration of Colorings Under Kempe Changes. STACS 2020: 35:1-35:14 - [i11]David Adjiashvili, Felix Hommelsheim, Moritz Mühlenthaler, Oliver Schaudt:
Fault-Tolerant Edge-Disjoint Paths - Beyond Uniform Faults. CoRR abs/2009.05382 (2020) - [i10]Tatsuhiko Hatanaka, Felix Hommelsheim, Takehiro Ito, Yusuke Kobayashi, Moritz Mühlenthaler, Akira Suzuki:
Fixed-Parameter Algorithms for Graph Constraint Logic. CoRR abs/2011.10385 (2020)
2010 – 2019
- 2019
- [j2]Moritz Mühlenthaler, Alexander Raß:
Runtime analysis of discrete particle swarm optimization algorithms: A survey. it Inf. Technol. 61(4): 177-185 (2019) - [c11]Marthe Bonamy, Marc Heinrich, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Moritz Mühlenthaler, Akira Suzuki, Kunihiro Wasa:
Diameter of Colorings Under Kempe Changes. COCOON 2019: 52-64 - [c10]Marthe Bonamy, Nicolas Bousquet, Marc Heinrich, Takehiro Ito, Yusuke Kobayashi, Arnaud Mary, Moritz Mühlenthaler, Kunihiro Wasa:
The Perfect Matching Reconfiguration Problem. MFCS 2019: 80:1-80:14 - [c9]Felix Hommelsheim, Moritz Mühlenthaler, Oliver Schaudt:
How to Secure Matchings Against Edge Failures. STACS 2019: 38:1-38:16 - [c8]Nicolas Bousquet, Tatsuhiko Hatanaka, Takehiro Ito, Moritz Mühlenthaler:
Shortest Reconfiguration of Matchings. WG 2019: 162-174 - [i9]Moritz Mühlenthaler, Alexander Raß, Manuel Schmitt, Rolf Wanka:
Exact Markov Chain-based Runtime Analysis of a Discrete Particle Swarm Optimization Algorithm on Sorting and OneMax. CoRR abs/1902.01810 (2019) - [i8]Marthe Bonamy, Nicolas Bousquet, Marc Heinrich, Takehiro Ito, Yusuke Kobayashi, Arnaud Mary, Moritz Mühlenthaler, Kunihiro Wasa:
The Perfect Matching Reconfiguration Problem. CoRR abs/1904.06184 (2019) - [i7]David Adjiashvili, Felix Hommelsheim, Moritz Mühlenthaler:
Flexible Graph Connectivity: Approximating Network Design Problems Between 1- and 2-connectivity. CoRR abs/1910.13297 (2019) - 2018
- [i6]Viktor Bindewald, Felix Hommelsheim, Moritz Mühlenthaler, Oliver Schaudt:
How to Secure Matchings Against Edge Failures. CoRR abs/1805.01299 (2018) - [i5]Nicolas Bousquet, Tatsuhiko Hatanaka, Takehiro Ito, Moritz Mühlenthaler:
Shortest Reconfiguration of Matchings. CoRR abs/1812.05419 (2018) - 2017
- [c7]Moritz Mühlenthaler, Alexander Raß, Manuel Schmitt, Andreas Siegling, Rolf Wanka:
Runtime Analysis of a Discrete Particle Swarm Optimization Algorithm on Sorting and OneMax. FOGA 2017: 13-24 - 2016
- [j1]Moritz Mühlenthaler, Rolf Wanka:
Fairness in academic course timetabling. Ann. Oper. Res. 239(1): 171-188 (2016) - [c6]Andreas Becher, Stefan Wildermann, Moritz Mühlenthaler, Jürgen Teich:
ReOrder: Runtime datapath generation for high-throughput multi-stream processing. ReConFig 2016: 1-8 - 2015
- [c5]Moritz Mühlenthaler:
Degree-Constrained Subgraph Reconfiguration is in P. MFCS (2) 2015: 505-516 - [i4]Moritz Mühlenthaler, Rolf Wanka:
On the Connectedness of Clash-free Timetables. CoRR abs/1507.02805 (2015) - [i3]Moritz Mühlenthaler:
Degree-constrained Subgraph Reconfiguration is in P. CoRR abs/1508.01372 (2015) - 2013
- [i2]Moritz Mühlenthaler, Rolf Wanka:
Fairness in Academic Course Timetabling. CoRR abs/1303.2860 (2013) - [i1]Moritz Mühlenthaler, Rolf Wanka:
A Decomposition of the Max-min Fair Curriculum-based Course Timetabling Problem. CoRR abs/1306.5601 (2013) - 2011
- [c4]Tobias Ziermann, Bernhard Schmidt, Moritz Mühlenthaler, Daniel Ziener, Josef Angermeier, Jürgen Teich:
An FPGA implementation of a threat-based strategy for Connect6. FPT 2011: 1-4 - [c3]Matthias Hoffmann, Moritz Mühlenthaler, Sabine Helwig, Rolf Wanka:
Discrete Particle Swarm Optimization for TSP: Theoretical Results and Experimental Evaluations. ICAIS 2011: 416-427 - [c2]Ludmila Omeltschuk, Sabine Helwig, Moritz Mühlenthaler, Rolf Wanka:
Heterogeneous constraint handling for particle swarm optimization. SWIS 2011: 37-43 - 2010
- [c1]Moritz Mühlenthaler, Rolf Wanka:
Improving Bitonic Sorting by Wire Elimination. ARCS Workshops 2010: 15-22
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-11-25 22:47 CET 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:
