default search action
Tobias Müller 0001
Person information
- affiliation: Groningen University, The Netherlands
- affiliation (former): University of Utrecht, Utrecht, The Netherlands
Other persons with the same name
- Tobias Müller — disambiguation page
- Tobias Müller 0002 — Saarland University, Saarbrücken, Germany
- Tobias Müller 0003 — University of Heidelberg, Germany
- Tobias Müller 0004 — Dresden University of Technology, Germany
- Tobias Müller 0005
— FZI Research Center for Information Technology, Karlsruhe, Germany
- Tobias Müller 0006 — University of Tübingen, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j52]Rani Hod, Michael Krivelevich, Tobias Müller, Alon Naor, Nicholas C. Wormald:
Component Games on Random Graphs. Comb. 42(6): 1189-1229 (2022) - [j51]Benjamin T. Hansen, Tobias Müller:
The critical probability for Voronoi percolation in the hyperbolic plane tends to 1/2. Random Struct. Algorithms 60(1): 54-67 (2022) - [j50]Lázaro Alberto Larrauri, Tobias Müller, Marc Noy:
Limiting probabilities of first order properties of random sparse graphs and hypergraphs. Random Struct. Algorithms 60(3): 506-526 (2022)
2010 – 2019
- 2018
- [j49]Tobias Müller, Marc Noy:
The first order convergence law fails for random perfect graphs. Electron. Notes Discret. Math. 68: 71-76 (2018) - [j48]Peter Heinig, Tobias Müller, Marc Noy, Anusch Taraz:
Logical limit laws for minor-closed classes of graphs. J. Comb. Theory B 130: 158-206 (2018) - [j47]Tobias Müller, Marc Noy:
The first order convergence law fails for random perfect graphs. Random Struct. Algorithms 53(4): 717-727 (2018) - [c12]Joachim Gudmundsson, Irina Kostitsyna
Theoretical analysis of beaconless geocast protocols in 1D. ANALCO 2018: 62-76 - 2017
- [j46]Tobias Müller:
The critical probability for confetti percolation equals 1/2. Random Struct. Algorithms 50(4): 679-697 (2017) - 2016
- [j45]Michel Bode, Nikolaos Fountoulakis
The probability of connectivity in a hyperbolic model of complex networks. Random Struct. Algorithms 49(1): 65-94 (2016) - 2015
- [j44]Mohammed El-Kebir
xHeinz: an algorithm for mining cross-species network modules under a flexible conservation model. Bioinform. 31(19): 3147-3155 (2015) - [j43]Anshui Li, Tobias Müller, Pawel Pralat:
Chasing robbers on percolated random geometric graphs. Contributions Discret. Math. 10(1) (2015) - [j42]Michel Bode, Nikolaos Fountoulakis
On the Largest Component of a Hyperbolic Model of Complex Networks. Electron. J. Comb. 22(3): 3 (2015) - [j41]Ross J. Kang, Tobias Müller, Douglas B. West:
On r-dynamic coloring of grids. Discret. Appl. Math. 186: 286-290 (2015) - [j40]Tobias Müller, Pawel Pralat:
The acquaintance time of (percolated) random geometric graphs. Eur. J. Comb. 48: 198-214 (2015) - 2014
- [j39]Ross J. Kang
Arrangements of Pseudocircles and Circles. Discret. Comput. Geom. 51(4): 896-925 (2014) - [j38]Colin McDiarmid, Tobias Müller:
The number of disk graphs. Eur. J. Comb. 35: 413-431 (2014) - [j37]Tobias Müller, Milos Stojakovic
A threshold for the Maker-Breaker clique game. Random Struct. Algorithms 45(2): 318-341 (2014) - [j36]Andrew Beveridge, Andrzej Dudek, Alan M. Frieze
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
- [j35]Tobias Müller:
A counterexample to a conjecture of Grünbaum on piercing convex sets in the plane. Discret. Math. 313(24): 2868-2871 (2013) - [j34]Colin McDiarmid, Tobias Müller:
Integer realizations of disk and segment graphs. J. Comb. Theory B 103(1): 114-143 (2013) - [j33]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
- [j32]Daniela Beisser, Stefan Brunkhorst, Thomas Dandekar
Robustness and accuracy of functional modules in integrated network analysis. Bioinform. 28(14): 1887-1894 (2012) - [j31]Daniela Beisser, Markus A. Grohme
Integrated pathway modules using time-course metabolic profiles and EST data from Milnesium tardigradum. BMC Syst. Biol. 6: 72 (2012) - [j30]Andrew Beveridge, Andrzej Dudek, Alan M. Frieze
Cops and Robbers on Geometric Graphs. Comb. Probab. Comput. 21(6): 816-834 (2012) - [j29]Ross J. Kang
Sphere and Dot Product Representations of Graphs. Discret. Comput. Geom. 47(3): 548-568 (2012) - [j28]Ross J. Kang
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
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
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 - [i2]Christine Staiger, Sidney Cadot, R. Kooter, Marcus T. Dittrich, Tobias Müller, Gunnar W. Klau, Lodewyk F. A. Wessels:
A critical evaluation of network and pathway based classifiers for outcome prediction in breast cancer. CoRR abs/1110.3717 (2011) - [i1]Colin McDiarmid, Tobias Müller:
Integer realizations of disk and segment graphs. CoRR abs/1111.2931 (2011) - 2010
- [j21]Daniela Beisser, Gunnar W. Klau
BioNet: an R-Package for the functional analysis of biological networks. Bioinform. 26(8): 1129-1130 (2010) - [j20]Louigi Addario-Berry, Ross J. Kang
Acyclic dominating partitions. J. Graph Theory 64(4): 292-311 (2010) - [j19]Christian Koetschan, Frank Förster
The ITS2 Database III - sequences and structures for phylogeny. Nucleic Acids Res. 38(Database-Issue): 275-279 (2010) - [c9]Ross J. Kang, Matthias Mnich
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
2000 – 2009
- 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) - [j17]Raphael Hauser
Conditioning of Random Conic Systems Under a General Family of Input Distributions. Found. Comput. Math. 9(3): 335-358 (2009) - [j16]Tobias Müller, Robert J. Waters:
Circular choosability is rational. J. Comb. Theory B 99(5): 801-813 (2009) - [j15]Frédéric Havet, Ross J. Kang
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
- [j14]Matthias Wolf
ProfDistS: (profile-) distance based phylogeny on sequence - structure alignments. Bioinform. 24(20): 2401-2402 (2008) - [j13]Tobias Müller:
Two-point concentration in random geometric graphs. Comb. 28(5): 529-545 (2008) - [j12]Ross J. Kang
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) - [j10]Christian Selig, Matthias Wolf
The ITS2 Database II: homology modelling RNA structure for molecular systematics. Nucleic Acids Res. 36(Database-Issue): 377-380 (2008) - [c5]Marcus T. Dittrich, Gunnar W. Klau
Identifying functional modules in protein-protein interaction networks: an integrated exact approach. ISMB 2008: 223-231 - 2007
- [j9]Daniel Gerlach, Matthias Wolf, Thomas Dandekar, Tobias Müller, Andreas Pokorny, Sven Rahmann:
Deep Metazoan Phylogeny. Silico Biol. 7(2): 151-154 (2007) - 2006
- [j8]Torben Friedrich, Birgit Pils, Thomas Dandekar
Modelling interaction sites in protein domains with interaction profile hidden Markov models. Bioinform. 22(23): 2851-2857 (2006) - [j7]Philipp N. Seibel, Tobias Müller, Thomas Dandekar
4SALE - A tool for synchronous RNA sequence and secondary structure alignment and editing. BMC Bioinform. 7: 498 (2006) - [j6]Jörg Schultz, Tobias Müller, Marco Achtziger, Philipp N. Seibel, Thomas Dandekar
The internal transcribed spacer 2 database - a web server for (not only) low level phylogenetic analyses. Nucleic Acids Res. 34(Web-Server-Issue): 704-707 (2006) - 2005
- [j5]Joachim Friedrich, Thomas Dandekar
ProfDist: a tool for the construction of large phylogenetic trees based on profile distances. Bioinform. 21(9): 2108-2109 (2005) - [j4]Matthias Wolf, Joachim Friedrich, Thomas Dandekar, Tobias Müller:
CBCAnalyzer: inferring phylogenies based on compensatory base changes in RNA secondary structures. Silico Biol. 5(3): 291-294 (2005) - 2004
- [j3]Torsten Crass, Iris Antes, Rico Basekow, Peer Bork
The Helmholtz Network for Bioinformatics: an integrative web portal for bioinformatics resources. Bioinform. 20(2): 268-270 (2004) - [j2]Katja Rateitschak, Tobias Müller, Martin Vingron:
Annotating significant pairs of transcription factor binding sites in regulatory DNA. Silico Biol. 4(4): 479-487 (2004) - 2003
- [c4]Tobias Müller, Sven Rahmann, Thomas Dandekar, Matthias Wolf:
Robust estimation of the phylogeny of Chlorophyceae(Chlorophyta)based on profile distances. German Conference on Bioinformatics 2003: 97-101 - [c3]Christine Steinhoff, Tobias Müller, Ulrike A. Nuber, Martin Vingron:
Gaussian Mixture Density Estimation Applied to Microarray Data. IDA 2003: 418-429 - 2001
- [c2]Tobias Müller, Sven Rahmann, Marc Rehmsmeier:
Non-symmetric score matrices and the detection of homologous transmembrane proteins. ISMB (Supplement of Bioinformatics) 2001: 182-189 - 2000
- [j1]Tobias Müller, Martin Vingron:
Modeling Amino Acid Replacement. J. Comput. Biol. 7(6): 761-776 (2000)
1990 – 1999
- 1999
- [c1]Tobias Müller, Rainer Spang, Martin Vingron:
A new method for modeling protein evolution. German Conference on Bioinformatics 1999: 2-8
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-12-13 19:10 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: