 | 2011 |
|---|
| 13 |       | Agelos Georgakopoulos,
Peter Winkler:
New Bounds for Edge-Cover by Random Walk
CoRR abs/1109.6619: (2011) |
| 12 | | Agelos Georgakopoulos,
Peter Winkler:
Two-Color Babylon
CoRR abs/1111.4189: (2011) |
| 11 | | Agelos Georgakopoulos:
Graph topologies induced by edge lengths.
Discrete Mathematics 311(15): 1523-1542 (2011) |
| 10 | | Ron Aharoni,
Eli Berger,
Agelos Georgakopoulos,
Amitai Perlstein,
Philipp Sprüssel:
The Max-Flow Min-Cut theorem for countable networks.
J. Comb. Theory, Ser. B 101(1): 1-17 (2011) |
| 2010 |
|---|
| 9 | | Henning Bruhn,
Reinhard Diestel,
Agelos Georgakopoulos,
Philipp Sprüssel:
Every rayless graph has an unfriendly partition.
Combinatorica 30(5): 521-532 (2010) |
| 8 | | Matt DeVos,
Agelos Georgakopoulos,
Bojan Mohar,
Robert Sámal:
An Eberhard-Like Theorem for Pentagons and Heptagons.
Discrete & Computational Geometry 44(4): 931-945 (2010) |
| 2009 |
|---|
| 7 | | Agelos Georgakopoulos:
A short proof of Fleischner's theorem.
Discrete Mathematics 309(23-24): 6632-6634 (2009) |
| 6 | | Agelos Georgakopoulos,
Philipp Sprüssel:
Geodetic Topological Cycles in Locally Finite Graphs.
Electr. J. Comb. 16(1): (2009) |
| 5 | | Agelos Georgakopoulos:
Topological Circles and Euler Tours in Locally Finite Graphs.
Electr. J. Comb. 16(1): (2009) |
| 4 | | Henning Bruhn,
Reinhard Diestel,
Agelos Georgakopoulos,
Philipp Sprüssel:
Every rayless graph has an unfriendly partition.
Electronic Notes in Discrete Mathematics 34: 279-281 (2009) |
| 3 | | Ron Aharoni,
Agelos Georgakopoulos,
Philipp Sprüssel:
Perfect matchings in r-partite r-graphs.
Eur. J. Comb. 30(1): 39-42 (2009) |
| 2008 |
|---|
| 2 | | Ron Aharoni,
Eli Berger,
Agelos Georgakopoulos,
Philipp Sprüssel:
Strongly Maximal Matchings in Infinite Graphs.
Electr. J. Comb. 15(1): (2008) |
| 2007 |
|---|
| 1 | | Agelos Georgakopoulos:
Connected but not path-connected subspaces of infinite graphs.
Combinatorica 27(6): 683-698 (2007) |
Data released under the ODC-BY 1.0 license — See also our legal information page