Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by Crossref.
Alon, Noga
Hamburger, Peter
and
Kostochka, Alexandr V.
1999.
Regular Honest Graphs, Isoperimetric Numbers, and Bisection of Weighted Graphs.
European Journal of Combinatorics,
Vol. 20,
Issue. 6,
p.
469.
Papadimitriou, Christos H.
and
Vempala, Santosh
2000.
On the approximability of the traveling salesman problem (extended abstract).
p.
126.
Monien, Burkhard
Preis, Robert
and
Diekmann, Ralf
2000.
Quality matching and local improvement for multilevel graph-partitioning.
Parallel Computing,
Vol. 26,
Issue. 12,
p.
1609.
Monien, Burkhard
and
Preis, Robert
2001.
Mathematical Foundations of Computer Science 2001.
Vol. 2136,
Issue. ,
p.
524.
Dellnitz, Michael
and
Preis, Robert
2003.
Symbolic and Numerical Scientific Computation.
Vol. 2630,
Issue. ,
p.
183.
Díaz, Josep
Serna, Maria J.
and
Wormald, Nicholas C.
2004.
LATIN 2004: Theoretical Informatics.
Vol. 2976,
Issue. ,
p.
49.
Monien, Burkhard
and
Preis, Robert
2006.
Upper bounds on the bisection width of 3- and 4-regular graphs.
Journal of Discrete Algorithms,
Vol. 4,
Issue. 3,
p.
475.
Paul, Gerald
Cohen, Reuven
Sreenivasan, Sameet
Havlin, Shlomo
and
Stanley, H. Eugene
2007.
Graph Partitioning Induced Phase Transitions.
Physical Review Letters,
Vol. 99,
Issue. 11,
Díaz, J.
Serna, M.J.
and
Wormald, N.C.
2007.
Bounds on the bisection width for random d -regular graphs.
Theoretical Computer Science,
Vol. 382,
Issue. 2,
p.
120.
BENJAMINI, ITAI
BERGER, NOAM
and
YADIN, ARIEL
2008.
Long-Range Percolation Mixing Time.
Combinatorics, Probability and Computing,
Vol. 17,
Issue. 4,
p.
487.
Benjamini, Itai
Haber, Simi
Krivelevich, Michael
and
Lubetzky, Eyal
2008.
The isoperimetric constant of the random graph process.
Random Structures & Algorithms,
Vol. 32,
Issue. 1,
p.
101.
Alon, Noga
PraŁat, PaweŁ
and
Wormald, Nicholas
2009.
Cleaning Regular Graphs with Brushes.
SIAM Journal on Discrete Mathematics,
Vol. 23,
Issue. 1,
p.
233.
Bazgan, Cristina
Tuza, Zsolt
and
Vanderpooten, Daniel
2010.
Satisfactory graph partition, variants, and generalizations.
European Journal of Operational Research,
Vol. 206,
Issue. 2,
p.
271.
Laszka, Aron
Szeszlér, Dávid
and
Buttyán, Levente
2012.
Decision and Game Theory for Security.
Vol. 7638,
Issue. ,
p.
152.
DasGupta, Bhaskar
and
Desai, Devendra
2013.
On the complexity of Newmanʼs community finding approach for biological and social networks.
Journal of Computer and System Sciences,
Vol. 79,
Issue. 1,
p.
50.
Lampis, Michael
2014.
Guest column.
ACM SIGACT News,
Vol. 45,
Issue. 1,
p.
48.
Kolesnik, Brett
and
Wormald, Nick
2014.
Lower Bounds for the Isoperimetric Numbers of Random Regular Graphs.
SIAM Journal on Discrete Mathematics,
Vol. 28,
Issue. 1,
p.
553.
HOD, RANI
and
NAOR, ALON
2014.
Component Games on Regular Graphs.
Combinatorics, Probability and Computing,
Vol. 23,
Issue. 1,
p.
75.
Andoni, Alexandr
Chen, Jiecao
Krauthgamer, Robert
Qin, Bo
Woodruff, David P.
and
Zhang, Qin
2016.
On Sketching Quadratic Forms.
p.
311.
Ostroumova Prokhorenkova, Liudmila
Prałat, Paweł
and
Raigorodskii, Andrei
2016.
Algorithms and Models for the Web Graph.
Vol. 10088,
Issue. ,
p.
115.