Остановите войну!
for scientists:
default search action
Tobias Müller 0001
- > Home > Persons > Tobias Müller 0001
Publications
- 2022
- [j51]Rani Hod, Michael Krivelevich, Tobias Müller, Alon Naor, Nicholas C. Wormald:
Component Games on Random Graphs. Comb. 42(6): 1189-1229 (2022) - 2016
- [j44]Michel Bode, Nikolaos Fountoulakis, Tobias Müller:
The probability of connectivity in a hyperbolic model of complex networks. Random Struct. Algorithms 49(1): 65-94 (2016) - 2015
- [j42]Anshui Li, Tobias Müller, Pawel Pralat:
Chasing robbers on percolated random geometric graphs. Contributions Discret. Math. 10(1) (2015) - [j41]Michel Bode, Nikolaos Fountoulakis, Tobias Müller:
On the Largest Component of a Hyperbolic Model of Complex Networks. Electron. J. Comb. 22(3): 3 (2015) - [j40]Ross J. Kang, Tobias Müller, Douglas B. West:
On r-dynamic coloring of grids. Discret. Appl. Math. 186: 286-290 (2015) - [j39]Tobias Müller, Pawel Pralat:
The acquaintance time of (percolated) random geometric graphs. Eur. J. Comb. 48: 198-214 (2015) - 2014
- [j38]Ross J. Kang, Tobias Müller:
Arrangements of Pseudocircles and Circles. Discret. Comput. Geom. 51(4): 896-925 (2014) - [j37]Colin McDiarmid, Tobias Müller:
The number of disk graphs. Eur. J. Comb. 35: 413-431 (2014) - [j36]Tobias Müller, Milos Stojakovic:
A threshold for the Maker-Breaker clique game. Random Struct. Algorithms 45(2): 318-341 (2014) - [j35]Andrew Beveridge, Andrzej Dudek, Alan M. Frieze, Tobias Müller, Milos Stojakovic:
Maker-breaker games on random geometric graphs. Random Struct. Algorithms 45(4): 553-607 (2014) - [i3]Ross J. Kang, Tobias Müller, Douglas B. West:
On r-dynamic Coloring of Grids. CoRR abs/1407.3504 (2014) - 2013
- [j33]Colin McDiarmid, Tobias Müller:
Integer realizations of disk and segment graphs. J. Comb. Theory, Ser. B 103(1): 114-143 (2013) - [j32]Tobias Müller, Erik Jan van Leeuwen, Jan van Leeuwen:
Integer Representations of Convex Polygon Intersection Graphs. SIAM J. Discret. Math. 27(1): 205-231 (2013) - 2012
- [j29]Ross J. Kang, Tobias Müller:
Sphere and Dot Product Representations of Graphs. Discret. Comput. Geom. 47(3): 548-568 (2012) - [j28]Ross J. Kang, Matthias Mnich, Tobias Müller:
Induced Matchings in Subcubic Planar Graphs. SIAM J. Discret. Math. 26(3): 1383-1411 (2012) - 2011
- [j27]Colin McDiarmid, Tobias Müller:
On the chromatic number of random geometric graphs. Comb. 31(4): 423-488 (2011) - [j26]Ross J. Kang, László Lovász, Tobias Müller, Edward R. Scheinerman:
Dot Product Representations of Planar Graphs. Electron. J. Comb. 18(1) (2011) - [j25]Tobias Müller, Attila Pór, Jean-Sébastien Sereni:
Graphs with Four Boundary Vertices. Electron. J. Comb. 18(1) (2011) - [j24]Ross J. Kang, Tobias Müller:
Frugal, acyclic and star colourings of graphs. Discret. Appl. Math. 159(16): 1806-1814 (2011) - [j23]Colin McDiarmid, Tobias Müller:
Counting disk graphs. Electron. Notes Discret. Math. 38: 627-632 (2011) - [j22]Tobias Müller, Xavier Pérez-Giménez, Nicholas C. Wormald:
Disjoint Hamilton cycles in the random geometric graph. J. Graph Theory 68(4): 299-322 (2011) - [c11]Tobias Müller, Erik Jan van Leeuwen, Jan van Leeuwen:
Integer representations of convex polygon intersection graphs. SCG 2011: 300-307 - [c10]Ross J. Kang, Tobias Müller:
Sphere and dot product representations of graphs. SCG 2011: 308-314 - [i1]Colin McDiarmid, Tobias Müller:
Integer realizations of disk and segment graphs. CoRR abs/1111.2931 (2011) - 2010
- [j20]Louigi Addario-Berry, Ross J. Kang, Tobias Müller:
Acyclic dominating partitions. J. Graph Theory 64(4): 292-311 (2010) - [c9]Ross J. Kang, Matthias Mnich, Tobias Müller:
Induced Matchings in Subcubic Planar Graphs. ESA (2) 2010: 112-122 - [c8]Ross J. Kang, Tobias Müller:
Dot Product Representations of Planar Graphs. GD 2010: 287-292 - [c7]Colin McDiarmid, Tobias Müller:
The Number of Bits Needed to Represent a Unit Disk Graph. WG 2010: 315-323 - 2009
- [j18]Tobias Müller, Jean-Sébastien Sereni:
Identifying and Locating-Dominating Codes in (Random) Geometric Networks. Comb. Probab. Comput. 18(6): 925-952 (2009) - [j15]Frédéric Havet, Ross J. Kang, Tobias Müller, Jean-Sébastien Sereni:
Circular choosability. J. Graph Theory 61(4): 241-270 (2009) - [c6]Ross J. Kang, Tobias Müller:
Acyclic and Frugal Colourings of Graphs. CTW 2009: 60-63 - 2008
- [j12]Ross J. Kang, Tobias Müller, Jean-Sébastien Sereni:
Improper colouring of (random) unit disk graphs. Discret. Math. 308(8): 1438-1454 (2008) - [j11]Tobias Müller, Attila Pór, Jean-Sébastien Sereni:
Lower bounding the boundary of a graph in terms of its maximum or minimum degree. Discret. Math. 308(24): 6581-6583 (2008)
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-03-24 00:08 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint