default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYannic Maus
Person information
- affiliation: TU Graz, Austria
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[c40]Sebastian Brandt, Yannic Maus, Ananth Narayanan, Florian Schager, Jara Uitto:
On the Locality of Hall's Theorem. SODA 2025: 4198-4226- 2024
- [c39]Rustam Latypov
, Yannic Maus, Shreyas Pai, Jara Uitto:
Adaptive Massively Parallel Coloring in Sparse Graphs. PODC 2024: 508-518 - [c38]Magnús M. Halldórsson, Yannic Maus:
Distributed Delta-Coloring Under Bandwidth Limitations. DISC 2024: 31:1-31:22 - [i39]Rustam Latypov, Yannic Maus, Shreyas Pai, Jara Uitto:
Adaptive Massively Parallel Coloring in Sparse Graphs. CoRR abs/2402.13755 (2024) - [i38]Magnús M. Halldórsson, Yannic Maus, Saku Peltonen:
Distributed Lovász Local Lemma under Bandwidth Limitations. CoRR abs/2405.07353 (2024) - [i37]Yannic Maus, Magnús M. Halldórsson:
Distributed Delta-Coloring under Bandwidth Limitations. CoRR abs/2405.09975 (2024) - [i36]Samuel Baguley, Yannic Maus, Janosch Ruff, George Skretas:
Hyperbolic Random Graphs: Clique Number and Degeneracy with Implications for Colouring. CoRR abs/2410.11549 (2024) - 2023
- [j8]Yannic Maus:
Distributed Graph Coloring Made Easy. ACM Trans. Parallel Comput. 10(4): 21:1-21:21 (2023) - [c37]Oswin Aichholzer, Man-Kwun Chiu, Hung P. Hoang, Michael Hoffmann, Jan Kyncl, Yannic Maus, Birgit Vogtenhuber, Alexandra Weinberger:
Drawings of Complete Multipartite Graphs up to Triangle Flips. SoCG 2023: 6:1-6:16 - [c36]Yannic Maus, Saku Peltonen, Jara Uitto:
Distributed Symmetry Breaking on Power Graphs via Sparsification. PODC 2023: 157-167 - [c35]Manuela Fischer, Magnús M. Halldórsson, Yannic Maus:
Fast Distributed Brooks' Theorem. SODA 2023: 2567-2588 - [c34]Alkida Balliu, Rustam Latypov, Yannic Maus, Dennis Olivetti, Jara Uitto:
Optimal Deterministic Massively Parallel Connectivity on Forests. SODA 2023: 2589-2631 - [c33]Rustam Latypov, Jakub Lacki, Yannic Maus, Jara Uitto:
Adaptive Massively Parallel Connectivity in Optimal Space. SPAA 2023: 431-441 - [c32]Chetan Gupta, Rustam Latypov, Yannic Maus, Shreyas Pai, Simo Särkkä, Jan Studený, Jukka Suomela, Jara Uitto, Hossein Vahidi:
Fast Dynamic Programming in Trees in the MPC Model. SPAA 2023: 443-453 - [c31]Christoph Grunau, Rustam Latypov, Yannic Maus, Shreyas Pai, Jara Uitto:
Conditionally Optimal Parallel Coloring of Forests. DISC 2023: 23:1-23:20 - [i35]Jakub Lacki, Rustam Latypov, Yannic Maus, Jara Uitto:
Adaptive Massively Parallel Connectivity in Optimal Space. CoRR abs/2302.04033 (2023) - [i34]Yannic Maus, Saku Peltonen, Jara Uitto:
Distributed Symmetry Breaking on Power Graphs via Sparsification. CoRR abs/2302.06878 (2023) - [i33]Oswin Aichholzer, Man-Kwun Chiu, Hung P. Hoang, Michael Hoffmann, Jan Kyncl, Yannic Maus, Birgit Vogtenhuber, Alexandra Weinberger:
Drawings of Complete Multipartite Graphs Up to Triangle Flips. CoRR abs/2303.07401 (2023) - [i32]Chetan Gupta, Rustam Latypov, Yannic Maus, Shreyas Pai, Simo Särkkä, Jan Studený, Jukka Suomela, Jara Uitto, Hossein Vahidi:
Fast Dynamic Programming in Trees in the MPC Model. CoRR abs/2305.03693 (2023) - [i31]Christoph Grunau, Rustam Latypov, Yannic Maus, Shreyas Pai, Jara Uitto:
Conditionally Optimal Parallel Coloring of Forests. CoRR abs/2308.00355 (2023) - 2022
- [j7]Yannic Maus, Tigran Tonoyan:
Linial for lists. Distributed Comput. 35(6): 533-546 (2022) - [j6]Karl Bringmann, Ralph Keusch, Johannes Lengler, Yannic Maus, Anisur Rahaman Molla:
Greedy routing and the algorithmic small-world phenomenon. J. Comput. Syst. Sci. 125: 59-105 (2022) - [c30]Keren Censor-Hillel, Yannic Maus, Shahar Romem Peled, Tigran Tonoyan:
Distributed Vertex Cover Reconfiguration. ITCS 2022: 36:1-36:23 - [c29]Alkida Balliu, Sebastian Brandt, Manuela Fischer, Rustam Latypov, Yannic Maus, Dennis Olivetti, Jara Uitto:
Exponential Speedup over Locality in MPC with Optimal Memory. DISC 2022: 9:1-9:21 - [c28]Magnús M. Halldórsson, Yannic Maus, Alexandre Nolin:
Fast Distributed Vertex Splitting with Applications. DISC 2022: 26:1-26:24 - [i30]Magnús M. Halldórsson, Yannic Maus, Alexandre Nolin:
Fast Distributed Vertex Splitting with Applications. CoRR abs/2208.08119 (2022) - [i29]Alkida Balliu, Sebastian Brandt, Manuela Fischer, Rustam Latypov, Yannic Maus, Dennis Olivetti, Jara Uitto:
Exponential Speedup Over Locality in MPC with Optimal Memory. CoRR abs/2208.09453 (2022) - [i28]Alkida Balliu, Rustam Latypov, Yannic Maus, Dennis Olivetti, Jara Uitto:
Optimal Deterministic Massively Parallel Connectivity on Forests. CoRR abs/2211.03530 (2022) - [i27]Manuela Fischer, Yannic Maus, Magnús M. Halldórsson:
Fast Distributed Brooks' Theorem. CoRR abs/2211.07606 (2022) - 2021
- [j5]Mohsen Ghaffari, Juho Hirvonen, Fabian Kuhn, Yannic Maus:
Improved distributed Δ-coloring. Distributed Comput. 34(4): 239-258 (2021) - [c27]Keren Censor-Hillel, Yannic Maus, Volodymyr Polosukhin:
Near-Optimal Scheduling in the Congested Clique. SIROCCO 2021: 50-67 - [c26]Yannic Maus:
Distributed Graph Coloring Made Easy. SPAA 2021: 362-372 - [c25]Magnús M. Halldórsson, Fabian Kuhn, Yannic Maus, Tigran Tonoyan:
Efficient randomized distributed coloring in CONGEST. STOC 2021: 1180-1193 - [c24]Alkida Balliu, Keren Censor-Hillel, Yannic Maus, Dennis Olivetti, Jukka Suomela:
Locally Checkable Labelings with Small Messages. DISC 2021: 8:1-8:18 - [c23]Yannic Maus, Jara Uitto:
Efficient CONGEST Algorithms for the Lovász Local Lemma. DISC 2021: 31:1-31:19 - [i26]Keren Censor-Hillel, Yannic Maus, Volodymyr Polosukhin:
Near-Optimal Scheduling in the Congested Clique. CoRR abs/2102.07221 (2021) - [i25]Alkida Balliu, Keren Censor-Hillel, Yannic Maus, Dennis Olivetti, Jukka Suomela:
Locally Checkable Labelings with Small Messages. CoRR abs/2105.05574 (2021) - [i24]Yannic Maus:
Distributed Graph Coloring Made Easy. CoRR abs/2105.05575 (2021) - [i23]Yannic Maus, Jara Uitto:
Efficient CONGEST Algorithms for the Lovasz Local Lemma. CoRR abs/2108.02638 (2021) - [i22]Keren Censor-Hillel, Yannic Maus, Shahar Romem Peled, Tigran Tonoyan:
Distributed Vertex Cover Reconfiguration. CoRR abs/2109.06601 (2021) - 2020
- [j4]Mohsen Ghaffari, Juho Hirvonen, Fabian Kuhn, Yannic Maus, Jukka Suomela, Jara Uitto:
Improved distributed degree splitting and edge coloring. Distributed Comput. 33(3-4): 293-310 (2020) - [j3]Yannic Maus:
The power of locality: Exploring the limits of randomness in distributed computing. it Inf. Technol. 62(5-6): 271-278 (2020) - [j2]Sebastian Daum, Fabian Kuhn, Yannic Maus:
Rumor spreading with bounded in-degree. Theor. Comput. Sci. 810: 43-57 (2020) - [c22]Magnús M. Halldórsson, Fabian Kuhn, Yannic Maus:
Distance-2 Coloring in the CONGEST Model. PODC 2020: 233-242 - [c21]Philipp Bamberger, Fabian Kuhn, Yannic Maus:
Efficient Deterministic Distributed Coloring with Small Bandwidth. PODC 2020: 243-252 - [c20]Alkida Balliu, Sebastian Brandt, Yuval Efron, Juho Hirvonen, Yannic Maus, Dennis Olivetti, Jukka Suomela:
Brief Announcement: Classification of Distributed Binary Labeling Problems. PODC 2020: 349-351 - [c19]Reuven Bar-Yehuda, Keren Censor-Hillel, Yannic Maus, Shreyas Pai, Sriram V. Pemmaraju:
Distributed Approximation on Power Graphs. PODC 2020: 501-510 - [c18]Yannic Maus, Tigran Tonoyan:
Local Conflict Coloring Revisited: Linial for Lists. DISC 2020: 16:1-16:18 - [c17]Alkida Balliu, Sebastian Brandt, Yuval Efron, Juho Hirvonen, Yannic Maus, Dennis Olivetti, Jukka Suomela:
Classification of Distributed Binary Labeling Problems. DISC 2020: 17:1-17:17 - [c16]Magnús M. Halldórsson, Fabian Kuhn, Yannic Maus, Alexandre Nolin:
Coloring Fast Without Learning Your Neighbors' Colors. DISC 2020: 39:1-39:17 - [i21]Magnús M. Halldórsson, Fabian Kuhn, Yannic Maus:
Distance-2 Coloring in the CONGEST Model. CoRR abs/2005.06528 (2020) - [i20]Reuven Bar-Yehuda, Keren Censor-Hillel, Yannic Maus, Shreyas Pai, Sriram V. Pemmaraju:
Distributed Approximation on Power Graphs. CoRR abs/2006.03746 (2020) - [i19]Yannic Maus, Tigran Tonoyan:
Local Conflict Coloring Revisited: Linial for Lists. CoRR abs/2007.15251 (2020) - [i18]Magnús M. Halldórsson, Fabian Kuhn, Yannic Maus, Alexandre Nolin:
Coloring Fast Without Learning Your Neighbors' Colors. CoRR abs/2008.04303 (2020) - [i17]Magnús M. Halldórsson, Fabian Kuhn, Yannic Maus, Tigran Tonoyan:
Efficient Randomized Distributed Coloring in CONGEST. CoRR abs/2012.14169 (2020)
2010 – 2019
- 2019
- [c15]Frederik Mallmann-Trenn, Yannic Maus, Dominik Pajak:
Noidy Conmunixatipn: On the Convergence of the Averaging Population Protocol. ICALP 2019: 148:1-148:16 - [c14]Philipp Bamberger, Fabian Kuhn, Yannic Maus:
Local Distributed Algorithms in Highly Dynamic Networks. IPDPS 2019: 33-42 - [c13]Janosch Deurer, Fabian Kuhn, Yannic Maus:
Deterministic Distributed Dominating Set Approximation in the CONGEST Model. PODC 2019: 94-103 - [c12]Philipp Bamberger, Mohsen Ghaffari, Fabian Kuhn, Yannic Maus, Jara Uitto:
On the Complexity of Distributed Splitting Problems. PODC 2019: 280-289 - [c11]Yannic Maus:
P-SLOCAL-Completeness of Maximum Independent Set Approximation. PODC 2019: 303-305 - [c10]Sebastian Brandt, Yannic Maus, Jara Uitto:
A Sharp Threshold Phenomenon for the Distributed Complexity of the Lovász Local Lemma. PODC 2019: 389-398 - [i16]Frederik Mallmann-Trenn, Yannic Maus, Dominik Pajak:
Noidy Conmunixatipn: On the Convergence of the Averaging Population Protocol. CoRR abs/1904.10984 (2019) - [i15]Janosch Deurer, Fabian Kuhn, Yannic Maus:
Deterministic Distributed Dominating Set Approximation in the CONGEST Model. CoRR abs/1905.10775 (2019) - [i14]Philipp Bamberger, Mohsen Ghaffari, Fabian Kuhn, Yannic Maus, Jara Uitto:
On the Complexity of Distributed Splitting Problems. CoRR abs/1905.11573 (2019) - [i13]Yannic Maus:
P-SLOCAL-Completeness of Maximum Independent Set Approximation. CoRR abs/1907.10499 (2019) - [i12]Sebastian Brandt, Yannic Maus, Jara Uitto:
A Sharp Threshold Phenomenon for the Distributed Complexity of the Lovász Local Lemma. CoRR abs/1908.06270 (2019) - [i11]Alkida Balliu, Sebastian Brandt, Yuval Efron, Juho Hirvonen, Yannic Maus, Dennis Olivetti, Jukka Suomela:
Classification of distributed binary labeling problems. CoRR abs/1911.13294 (2019) - [i10]Philipp Bamberger, Fabian Kuhn, Yannic Maus:
Efficient Deterministic Distributed Coloring with Small Bandwidth. CoRR abs/1912.02814 (2019) - 2018
- [b1]Yannic Maus:
The power of locality: exploring the limits of randomness in distributed computing. University of Freiburg, Freiburg im Breisgau, Germany, 2018 - [c9]Mohsen Ghaffari, Juho Hirvonen, Fabian Kuhn, Yannic Maus:
Improved Distributed Delta-Coloring. PODC 2018: 427-436 - [c8]Fabian Kuhn, Yannic Maus, Simon Weidner:
Deterministic Distributed Ruling Sets of Line Graphs. SIROCCO 2018: 193-208 - [c7]Mohsen Ghaffari, Fabian Kuhn, Yannic Maus, Jara Uitto:
Deterministic distributed edge-coloring with fewer colors. STOC 2018: 418-430 - [c6]Philipp Bamberger, Fabian Kuhn, Yannic Maus:
Brief Announcement: Local Distributed Algorithms in Highly Dynamic Networks. DISC 2018: 42:1-42:4 - [i9]Philipp Bamberger, Fabian Kuhn, Yannic Maus:
Local Distributed Algorithms in Highly Dynamic Networks. CoRR abs/1802.10199 (2018) - [i8]Mohsen Ghaffari, Juho Hirvonen, Fabian Kuhn, Yannic Maus:
Improved Distributed Δ-Coloring. CoRR abs/1803.03248 (2018) - [i7]Fabian Kuhn, Yannic Maus, Simon Weidner:
Deterministic Distributed Ruling Sets of Line Graphs. CoRR abs/1805.07209 (2018) - 2017
- [j1]Manuela Fischer, Yannic Maus:
DISC 2017 Review. SIGACT News 48(4): 94-99 (2017) - [c5]Karl Bringmann, Ralph Keusch, Johannes Lengler, Yannic Maus, Anisur Rahaman Molla:
Greedy Routing and the Algorithmic Small-World Phenomenon. PODC 2017: 371-380 - [c4]Mohsen Ghaffari, Fabian Kuhn, Yannic Maus:
On the complexity of local distributed graph problems. STOC 2017: 784-797 - [c3]Mohsen Ghaffari, Juho Hirvonen, Fabian Kuhn, Yannic Maus, Jukka Suomela, Jara Uitto:
Improved Distributed Degree Splitting and Edge Coloring. DISC 2017: 19:1-19:15 - [i6]Mohsen Ghaffari, Juho Hirvonen, Fabian Kuhn, Yannic Maus, Jukka Suomela, Jara Uitto:
Improved Distributed Degree Splitting and Edge Coloring. CoRR abs/1706.04746 (2017) - [i5]Mohsen Ghaffari, Fabian Kuhn, Yannic Maus, Jara Uitto:
Deterministic Distributed Edge-Coloring with Fewer Colors. CoRR abs/1711.05469 (2017) - 2016
- [c2]Sebastian Daum, Fabian Kuhn, Yannic Maus:
Rumor Spreading with Bounded In-Degree. SIROCCO 2016: 323-339 - [c1]Dan Hefetz, Fabian Kuhn, Yannic Maus, Angelika Steger:
Polynomial Lower Bound for Distributed Graph Coloring in a Weak LOCAL Model. DISC 2016: 99-113 - [i4]Dan Hefetz, Fabian Kuhn, Yannic Maus, Angelika Steger:
A Polynomial Lower Bound for Distributed Graph Coloring in a Weak LOCAL Model. CoRR abs/1607.05212 (2016) - [i3]Mohsen Ghaffari, Fabian Kuhn, Yannic Maus:
On the Complexity of Local Distributed Graph Problems. CoRR abs/1611.02663 (2016) - [i2]Karl Bringmann, Ralph Keusch, Johannes Lengler, Yannic Maus, Anisur Rahaman Molla:
Greedy Routing and the Algorithmic Small-World Phenomenom. CoRR abs/1612.05539 (2016) - 2015
- [i1]Sebastian Daum, Fabian Kuhn, Yannic Maus:
Rumor Spreading with Bounded In-Degree. CoRR abs/1506.00828 (2015)
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 2025-01-29 22:14 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:
