default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDieter Mitsche
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j52]Lyuben Lichev
, Dieter Mitsche, Guillem Perarnau:
Percolation on dense random graphs with given degrees. J. Comb. Theory B 167: 250-282 (2024)- 2023
- [j51]Lyuben Lichev, Dieter Mitsche:
On the Minimum Bisection of Random 3-Regular Graphs. Electron. J. Comb. 30(2) (2023) - [j50]Lyuben Lichev, Dieter Mitsche, Pawel Pralat:
Localization game for random geometric graphs. Eur. J. Comb. 108: 103616 (2023) - [j49]Lyuben Lichev, Dieter Mitsche, Lutz Warnke:
The jump of the clique chromatic number of random graphs. Random Struct. Algorithms 62(4): 1016-1034 (2023) - [i25]Marcos Kiwi, Lyuben Lichev, Dieter Mitsche, Pawel Pralat:
Label propagation on binomial random graphs. CoRR abs/2302.03569 (2023) - [i24]Alberto Espuny Díaz, Lyuben Lichev, Dieter Mitsche, Alexandra Wesolek:
Sharp threshold for embedding balanced spanning trees in random geometric graphs. CoRR abs/2303.14229 (2023) - 2022
- [j48]Lyuben Lichev, Dieter Mitsche:
On the modularity of 3-regular random graphs and random graphs with given degree sequences. Random Struct. Algorithms 61(4): 754-802 (2022) - [j47]Nicolas Fraiman, Lyuben Lichev, Dieter Mitsche:
On the Power of Choice for Boolean Functions. SIAM J. Discret. Math. 36(3): 1943-1954 (2022) - 2021
- [j46]Josep Díaz, Dieter Mitsche:
A survey of the modified Moran process and evolutionary graph theory. Comput. Sci. Rev. 39: 100347 (2021) - [j45]Michael Fuchs, Cecilia Holmgren, Dieter Mitsche, Ralph Neininger:
A note on the independence number, domination number and related parameters of random binary search trees and random recursive trees. Discret. Appl. Math. 292: 64-71 (2021) - [i23]Lyuben Lichev, Dieter Mitsche, Lutz Warnke:
The jump of the clique chromatic number of random graphs. CoRR abs/2105.12168 (2021) - [i22]Nicolas Fraiman, Lyuben Lichev, Dieter Mitsche:
On the power of choice for Boolean functions. CoRR abs/2109.13079 (2021) - 2020
- [j44]Dieter Mitsche, Michael Molloy, Pawel Pralat:
k-regular subgraphs near the k-core threshold of a random graph. J. Comb. Theory B 142: 106-143 (2020) - [j43]Kevin Leckey, Dieter Mitsche, Nick Wormald:
The height of depth-weighted random recursive trees. Random Struct. Algorithms 56(3): 851-866 (2020) - [j42]Josep Díaz, Colin McDiarmid, Dieter Mitsche:
Learning random points from geometric graphs or orderings. Random Struct. Algorithms 57(2): 339-370 (2020)
2010 – 2019
- 2019
- [j41]Colin McDiarmid, Dieter Mitsche, Pawel Pralat:
Clique coloring of binomial random graphs. Random Struct. Algorithms 54(4): 589-614 (2019) - [j40]Marcos A. Kiwi, Dieter Mitsche:
On the Second Largest Component of Random Hyperbolic Graphs. SIAM J. Discret. Math. 33(4): 2200-2217 (2019) - 2018
- [j39]Colin McDiarmid, Dieter Mitsche, Pawel Pralat:
Clique Colourings of Geometric Graphs. Electron. J. Comb. 25(4): 4 (2018) - [j38]Dieter Mitsche, Juanjo Rué:
Corrigendum to "On the limiting distribution of the metric dimension for random forests" [European J. Combin. 49(2015) 68-89]. Eur. J. Comb. 67: 275-277 (2018) - [j37]J. Barré, Marc Lelarge, Dieter Mitsche:
On rigidity, orientability, and cores of random graphs with sliders. Random Struct. Algorithms 52(3): 419-453 (2018) - [j36]Nicolas Fraiman, Dieter Mitsche:
The diameter of inhomogeneous random graphs. Random Struct. Algorithms 53(2): 308-326 (2018) - [j35]Dieter Mitsche, Pawel Pralat, Elham Roshanbin:
Burning number of graph products. Theor. Comput. Sci. 746: 124-135 (2018) - [c20]Ruy Fabila Monroy, Carlos Hidalgo-Toscano, Clemens Huemer, Dolores Lara, Dieter Mitsche:
Optimal Grid Drawings of Complete Multipartite Graphs and an Integer Variant of the Algebraic Connectivity. GD 2018: 593-605 - [i21]Ruy Fabila Monroy, Carlos Hidalgo-Toscano, Clemens Huemer, Dolores Lara, Dieter Mitsche:
Optimal Grid Drawings of Complete Multipartite Graphs and an Integer Variant of the Algebraic Connectivity. CoRR abs/1808.09024 (2018) - [i20]Josep Díaz, Colin McDiarmid, Dieter Mitsche:
Learning random points from geometric graphs or orderings. CoRR abs/1809.09879 (2018) - 2017
- [j34]Ewa J. Infeld, Dieter Mitsche, Pawel Pralat:
The Total Acquisition Number of Random Geometric Graphs. Electron. J. Comb. 24(3): 3 (2017) - [j33]Dieter Mitsche, Pawel Pralat, Elham Roshanbin:
Burning Graphs: A Probabilistic Perspective. Graphs Comb. 33(2): 449-471 (2017) - [j32]Dieter Mitsche, Guillem Perarnau:
On Treewidth and Related Parameters of Random Geometric Graphs. SIAM J. Discret. Math. 31(2): 1328-1354 (2017) - 2016
- [j31]Dieter Mitsche, Xavier Pérez-Giménez, Pawel Pralat:
The Bondage Number of Random Graphs. Electron. J. Comb. 23(2): 2 (2016) - [j30]Andrzej Dudek, Dieter Mitsche, Pawel Pralat:
The set chromatic number of random graphs. Discret. Appl. Math. 215: 61-70 (2016) - [j29]Omer Giménez, Dieter Mitsche, Marc Noy:
Maximum degree in minor-closed classes of graphs. Eur. J. Comb. 55: 41-61 (2016) - [j28]Adam Douglas Henry, Dieter Mitsche, Pawel Pralat:
Homophily, influence and the decay of segregation in self-organizing networks. Netw. Sci. 4(1): 81-116 (2016) - [j27]Sabina Zejnilovic, Dieter Mitsche, João Gomes, Bruno Sinopoli:
Extending the metric dimension to graphs with missing edges. Theor. Comput. Sci. 609: 384-394 (2016) - [j26]Anthony Bonato, Dieter Mitsche, Xavier Pérez-Giménez, Pawel Pralat:
A probabilistic version of the game of Zombies and Survivors on graphs. Theor. Comput. Sci. 655: 2-14 (2016) - [i19]Didier Josselin, Vincent Labatut, Dieter Mitsche:
Straightness of rectilinear vs. radio-concentric networks: modeling simulation and comparison. CoRR abs/1609.05719 (2016) - 2015
- [j25]Alan M. Frieze, Dieter Mitsche, Xavier Pérez-Giménez, Pawel Pralat:
On-line List Colouring of Random Graphs. Electron. J. Comb. 22(2): 2 (2015) - [j24]Dieter Mitsche, Juanjo Rué:
On the limiting distribution of the metric dimension for random forests. Eur. J. Comb. 49: 68-89 (2015) - [j23]Didier Josselin, Sonia Chekir, Alain Pasquet, Vincent Labatut, Yvan Capowiez, Christophe Mazzia, Yezekael Hayel, Adrien Lammoglia, Cyrille Genre-Grandpierre, Dieter Mitsche, Frédéric Patras:
Modélisation, simulation et analyse de propriétés de réseaux orbitèles. Rev. Int. Géomatique 25(4): 515-536 (2015) - [c19]Marcos A. Kiwi, Dieter Mitsche:
A Bound for the Diameter of Random Hyperbolic Graphs. ANALCO 2015: 26-39 - [c18]Anthony Bonato, Marc Lozier, Dieter Mitsche, Xavier Pérez-Giménez, Pawel Pralat:
The Domination Number of On-line Social Networks and Random Geometric Graphs. TAMC 2015: 150-163 - [i18]Alan M. Frieze, Dieter Mitsche, Xavier Pérez-Giménez, Pawel Pralat:
On-line list colouring of random graphs. CoRR abs/1501.07469 (2015) - [i17]Dieter Mitsche, Xavier Pérez-Giménez, Pawel Pralat:
Strong-majority bootstrap percolation on regular graphs with low dissemination threshold. CoRR abs/1503.08310 (2015) - [i16]Anthony Bonato, Dieter Mitsche, Xavier Pérez-Giménez, Pawel Pralat:
A probabilistic version of the game of Zombies and Survivors on graphs. CoRR abs/1503.08810 (2015) - [i15]Dieter Mitsche, Pawel Pralat, Elham Roshanbin:
Burning graphs - a probabilistic perspective. CoRR abs/1505.03052 (2015) - 2014
- [j22]Dieter Mitsche, Pawel Pralat:
On the Hyperbolicity of Random Graphs. Electron. J. Comb. 21(2): 2 (2014) - [j21]Anthony Bonato, Jason I. Brown, Dieter Mitsche, Pawel Pralat:
Independence densities of hypergraphs. Eur. J. Comb. 40: 124-136 (2014) - [j20]Ruy Fabila Monroy, Clemens Huemer, Dieter Mitsche:
The number of empty four-gons in random point sets. Electron. Notes Discret. Math. 46: 161-168 (2014) - [j19]Athanasios Kehagias, Dieter Mitsche, Pawel Pralat:
The Role of Visibility in Pursuit/Evasion Games. Robotics 3(4): 371-399 (2014) - [j18]Dieter Mitsche, Giovanni Resta, Paolo Santi:
The random waypoint mobility model with uniform node spatial distribution. Wirel. Networks 20(5): 1053-1066 (2014) - [c17]Sabina Zejnilovic, Dieter Mitsche, João Gomes, Bruno Sinopoli:
Network observability for source localization in graphs with unobserved edges. GlobalSIP 2014: 857-861 - [i14]Athanasios Kehagias, Dieter Mitsche, Pawel Pralat:
The Role of Visibility in Pursuit / Evasion Games. CoRR abs/1402.6136 (2014) - [i13]Josep Díaz, Dieter Mitsche, Guillem Perarnau, Xavier Pérez-Giménez:
On the relation between graph distance and Euclidean distance in random geometric graphs. CoRR abs/1404.4757 (2014) - [i12]Anthony Bonato, David F. Gleich, Myunghwan Kim, Dieter Mitsche, Pawel Pralat, Amanda Tian, Stephen J. Young:
Dimensionality of social networks using motifs and eigenvalues. CoRR abs/1405.0157 (2014) - [i11]Anthony Bonato, Marc Lozier, Dieter Mitsche, Xavier Pérez-Giménez, Pawel Pralat:
The domination number of on-line social networks and random geometric graphs. CoRR abs/1412.1189 (2014) - 2013
- [j17]William B. Kinnersley, Dieter Mitsche, Pawel Pralat:
A Note on the Acquaintance Time of Random Graphs. Electron. J. Comb. 20(3): 52 (2013) - [j16]Béla Bollobás, Dieter Mitsche, Pawel Pralat:
Metric Dimension for Random Graphs. Electron. J. Comb. 20(4): 1 (2013) - [j15]Dieter Mitsche, Pawel Pralat:
Revolutionaries and Spies on Random Graphs. Comb. Probab. Comput. 22(3): 417-432 (2013) - [j14]Anthony Bonato, Dieter Mitsche, Pawel Pralat:
Vertex-Pursuit in Random Directed Acyclic Graphs. SIAM J. Discret. Math. 27(2): 732-756 (2013) - [j13]Abbas Mehrabian, Dieter Mitsche, Pawel Pralat:
On the Maximum Density of Graphs with Unique-Path Labelings. SIAM J. Discret. Math. 27(3): 1228-1233 (2013) - [j12]Athanasios Kehagias, Dieter Mitsche, Pawel Pralat:
Cops and invisible robbers: The cost of drunkenness. Theor. Comput. Sci. 481: 100-120 (2013) - [c16]Dieter Mitsche, George Saad, Jared Saia:
The Power of Mediation in an Extended El Farol Game. SAGT 2013: 50-61 - [i10]Dieter Mitsche, George Saad, Jared Saia:
The Power of Mediation in an Extended El Farol Game. CoRR abs/1307.7122 (2013) - [i9]Anthony Bonato, Stephen Finbow, Przemyslaw Gordinowicz, Ali Haidar, William B. Kinnersley, Dieter Mitsche, Pawel Pralat, Ladislav Stacho:
The robber strikes back. CoRR abs/1308.2843 (2013) - 2012
- [j11]Carme Àlvarez, Josep Díaz, Dieter Mitsche, Maria J. Serna:
Continuous monitoring in the dynamic sensor field model. Theor. Comput. Sci. 463: 114-122 (2012) - [c15]Dieter Mitsche, Guillem Perarnau:
On the treewidth and related parameters of random geometric graphs. STACS 2012: 408-419 - [c14]Anthony Bonato, Dieter Mitsche, Pawel Pralat:
Vertex-Pursuit in Hierarchical Social Networks. TAMC 2012: 50-60 - [i8]Athanasios Kehagias, Dieter Mitsche, Pawel Pralat:
Cops and Invisible Robbers: the Cost of Drunkenness. CoRR abs/1201.0946 (2012) - [i7]Lali Barrière, Clemens Huemer, Dieter Mitsche, David Orden:
On the Fiedler value of large planar graphs. CoRR abs/1206.3870 (2012) - 2011
- [j10]Lali Barrière, Clemens Huemer, Dieter Mitsche, David Orden:
On the Fiedler value of large planar graphs (Extended abstract). Electron. Notes Discret. Math. 38: 111-116 (2011) - [j9]Dieter Mitsche, Maria Saumell, Rodrigo I. Silveira:
On the number of higher order Delaunay triangulations. Theor. Comput. Sci. 412(29): 3589-3597 (2011) - [c13]Carme Àlvarez, Josep Díaz, Dieter Mitsche, Maria J. Serna:
Continuous Monitoring in the Dynamic Sensor Field Model. ALGOSENSORS 2011: 161-172 - [c12]Josep Díaz, Alberto Marchetti-Spaccamela, Dieter Mitsche, Paolo Santi, Julinda Stefa:
Social-Aware Forwarding Improves Routing Performance in Pocket Switched Networks. ESA 2011: 723-735 - [p1]Josep Díaz, Dieter Mitsche, Paolo Santi:
Theoretical Aspects of Graph Models for MANETs. Theoretical Aspects of Distributed Computing in Sensor Networks 2011: 161-190 - 2010
- [j8]Josep Díaz, Dieter Mitsche:
The cook-book approach to the differential equation method. Comput. Sci. Rev. 4(3): 129-151 (2010) - [j7]Robert Berke, Dieter Mitsche:
Colorings at minimum cost. Discret. Math. 310(3): 561-569 (2010) - [c11]Dieter Mitsche, Maria Saumell, Rodrigo I. Silveira:
On the Number of Higher Order Delaunay Triangulations. CIAC 2010: 217-228 - [i6]Dieter Mitsche, Maria Saumell, Rodrigo I. Silveira:
On the Number of Higher Order Delaunay Triangulations. CoRR abs/1002.4364 (2010) - [i5]Josep Díaz, Alberto Marchetti-Spaccamela, Dieter Mitsche, Paolo Santi, Julinda Stefa:
Social-Aware Forwarding Improves Routing Performance in Pocket Switched Networks. CoRR abs/1007.5240 (2010)
2000 – 2009
- 2009
- [j6]Josep Díaz, Lefteris M. Kirousis, Dieter Mitsche, Xavier Pérez-Giménez:
On the satisfiability threshold of formulas with three literals per clause. Theor. Comput. Sci. 410(30-32): 2920-2934 (2009) - [j5]Josep Díaz, Dieter Mitsche, Xavier Pérez-Giménez:
Large Connectivity for Dynamic Random Geometric Graphs. IEEE Trans. Mob. Comput. 8(6): 821-835 (2009) - [c10]Josep Díaz, Dieter Mitsche, Navin Rustagi, Jared Saia:
On the Power of Mediators. WINE 2009: 455-462 - 2008
- [j4]Dieter Mitsche:
Review of "Introduction to clustering large and high-dimensional data" by J. Kogan. Comput. Sci. Rev. 2(1): 60-62 (2008) - [c9]Josep Díaz, Lefteris M. Kirousis, Dieter Mitsche, Xavier Pérez-Giménez:
A new upper bound for 3-SAT. FSTTCS 2008: 163-174 - [c8]Josep Díaz, Dieter Mitsche, Xavier Pérez-Giménez:
On the connectivity of dynamic random geometric graphs. SODA 2008: 601-610 - [i4]Josep Díaz, Dieter Mitsche, Xavier Pérez-Giménez:
On the Probability of the Existence of Fixed-Size Components in Random Geometric Graphs. CoRR abs/0806.0311 (2008) - [i3]Josep Díaz, Lefteris M. Kirousis, Dieter Mitsche, Xavier Pérez-Giménez:
A new upper bound for 3-SAT. CoRR abs/0807.3600 (2008) - 2007
- [j3]Martin Marciniszyn, Dieter Mitsche, Milos Stojakovic:
Online balanced graph avoidance games. Eur. J. Comb. 28(8): 2248-2263 (2007) - [j2]Dieter Mitsche:
Between Colorings and Layouts - Minimum Morphism Cost Problems. Electron. Notes Discret. Math. 28: 215-221 (2007) - [j1]Josep Díaz, Dieter Mitsche, Xavier Pérez-Giménez:
Sharp Threshold for Hamiltonicity of Random Geometric Graphs. SIAM J. Discret. Math. 21(1): 57-65 (2007) - [c7]Joachim Giesen, Dieter Mitsche, Eva Schuberth:
Collaborative Ranking: An Aggregation Algorithm for Individuals' Preference Estimation. AAIM 2007: 58-67 - [i2]Josep Díaz, Dieter Mitsche, Xavier Pérez-Giménez:
Dynamic Random Geometric Graphs. CoRR abs/cs/0702074 (2007) - 2006
- [i1]Josep Díaz, Dieter Mitsche, Xavier Pérez-Giménez:
Sharp threshold for hamiltonicity of random geometric graphs. CoRR abs/cs/0607023 (2006) - 2005
- [c6]Joachim Giesen, Dieter Mitsche:
Reconstructing Many Partitions Using Spectral Techniques. FCT 2005: 433-444 - [c5]Joachim Giesen, Dieter Mitsche:
Boosting Spectral Partitioning by Sampling and Iteration. ISAAC 2005: 473-482 - [c4]Joachim Giesen, Dieter Mitsche:
Bounding the Misclassification Error in Spectral Partitioning in the Planted Partition Model. WG 2005: 409-420 - 2004
- [c3]Johann Eder, Christian Koncilia, Dieter Mitsche:
Analysing Slices of Data Warehouses to Detect Structural Modifications. CAiSE 2004: 492-505 - [c2]Udo Adamy, Thomas Erlebach, Dieter Mitsche, Ingo Schurr, Bettina Speckmann, Emo Welzl:
Off-line Admission Control for Advance Reservations in Star Networks. WAOA 2004: 211-224 - 2003
- [c1]Johann Eder, Christian Koncilia, Dieter Mitsche:
Automatic Detection of Structural Changes in Data Warehouses. DaWaK 2003: 119-128
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-08-05 21:24 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:
