S. Kannan, C. Mathieu, and H. Zhou, Near-Linear Query Complexity for Graph Inference, proceedings of the International Colloquium on Automata, Languages and Programming (ICALP), 2015.
DOI : 10.1007/978-3-662-47672-7_63

P. Klein, C. Mathieu, and H. Zhou, Correlation clustering and two-edge-connected augmentation for planar graphs, proceedings of the Symposium on Theoretical Aspects of Computer Science (STACS), 2015.

M. Lelarge and H. Zhou, Sublinear-time algorithms for monomer???dimer systems on bounded degree graphs, 2014. A preliminary version appears in proceedings of the International Symposium on Algorithms and Computation (ISAAC), pp.68-78, 2013.
DOI : 10.1016/j.tcs.2014.06.040

URL : https://hal.archives-ouvertes.fr/hal-00917432

C. Mathieu and H. Zhou, Graph Reconstruction via Distance Oracles, proceedings of the International Colloquium on Automata, Languages and Programming (ICALP), 2013.
DOI : 10.1007/978-3-642-39206-1_62

URL : http://arxiv.org/abs/1304.6588

F. Benhamouda, T. Lepoint, and H. Zhou, Optimization of Bootstrapping in Circuits, Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms
DOI : 10.1137/1.9781611974782.160

D. Achlioptas, A. Clauset, D. Kempe, and C. Moore, On the bias of traceroute sampling: or, power-law degree distributions in regular graphs, Bibliography Journal of the ACM (JACM), vol.56, issue.4, p.21, 2009.

N. Ailon, M. Charikar, and A. Newman, Aggregating inconsistent information: Ranking and clustering, Journal of the ACM, vol.55, issue.5, 2008.
DOI : 10.1145/1060590.1060692

S. Alpert, M. Galun, R. Basri, and A. Brandt, Image segmentation by probabilistic bottom-up aggregation and cue integration, Computer Vision and Pattern Recognition, pp.1-8, 2007.
DOI : 10.1109/cvpr.2007.383017

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.120.1687

A. Alush and J. Goldberger, Ensemble segmentation using efficient integer linear programming. Pattern Analysis and Machine Intelligence, pp.1966-1977, 2012.

A. Alush and J. Goldberger, Break and Conquer: Efficient Correlation Clustering for Image Segmentation, Similarity-Based Pattern Recognition, pp.134-147, 2013.
DOI : 10.1007/978-3-642-39140-8_9

B. Andres, J. H. Kappes, T. Beier, U. Kothe, and F. A. Hamprecht, Probabilistic image segmentation with closedness constraints, 2011 International Conference on Computer Vision, pp.2611-2618, 2011.
DOI : 10.1109/ICCV.2011.6126550

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.382.7688

D. Angluin and J. Chen, Learning a Hidden Graph Using O(log n) Queries Per Edge, Learning Theory, pp.210-223, 2004.
DOI : 10.1007/978-3-540-27819-1_15

B. Awerbuch, A. Bar-noy, N. Linial, and D. Peleg, Improved routing strategies with succinct tables, Journal of Algorithms, vol.11, issue.3, pp.307-341, 1990.
DOI : 10.1016/0196-6774(90)90017-9

B. Awerbuch and D. Peleg, Routing with Polynomial Communication-Space Srade-ff, SIAM Journal on Discrete Mathematics, vol.5, issue.2, pp.151-162, 1992.
DOI : 10.1137/0405013

Y. Bachrach, P. Kohli, V. Kolmogorov, and M. Zadimoghaddam, Optimal coalition structure generation in cooperative graph games, Conference on Artificial Intelligence, 2013.

N. Bansal, A. Blum, and S. Chawla, Correlation clustering, Machine Learning, pp.89-113, 2004.

M. Bateni, M. Hajiaghayi, P. N. Klein, and C. Mathieu, A Polynomial-time Approximation Scheme for Planar Multiway Cut, Symposium on Discrete Algorithms, pp.639-655, 2012.
DOI : 10.1137/1.9781611973099.54

M. Bateni, M. Hajiaghayi, and D. Marx, Approximation schemes for Steiner forest on planar graphs and graphs of bounded treewidth, Journal of the ACM, vol.58, issue.5, p.21, 2011.

Z. Beerliova, F. Eberhard, T. Erlebach, A. Hall, and M. Hoffmann, Network Discovery and Verification, IEEE Journal on Selected Areas in Communications, vol.24, issue.12, pp.2168-2181, 2006.
DOI : 10.1109/JSAC.2006.884015

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.68.9121

A. Ben-dor, R. Shamir, and Z. Yakhini, Clustering Gene Expression Patterns, Journal of Computational Biology, vol.6, issue.3-4, pp.281-297, 1999.
DOI : 10.1089/106652799318274

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.34.5341

A. Berger and M. Grigni, Minimum Weight 2-Edge-Connected Spanning Subgraphs in Planar Graphs, International Colloquium on Automata, Languages and Programming, pp.90-101, 2007.
DOI : 10.1007/978-3-540-73420-8_10

R. S. Jean, B. Blair, and . Peyton, An introduction to chordal graphs and clique trees, Graph theory and sparse matrix computation, pp.1-29, 1993.

S. Böcker and J. Baumbach, Cluster Editing, The Nature of Computation. Logic, Algorithms, Applications, pp.33-44, 2013.
DOI : 10.1007/978-3-642-39053-1_5

G. Borradaile, D. Erik, S. Demaine, and . Tazari, Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus Graphs, Algorithmica, vol.157, issue.3, pp.287-311, 2014.
DOI : 10.1007/s00453-012-9662-2

URL : https://hal.archives-ouvertes.fr/inria-00359068

G. Borradaile and P. N. Klein, The two-edge connectivity survivable network problem in planar graphs, International Colloquium on Automata, Languages and Programming, pp.485-501, 2008.

G. Borradaile, P. N. Klein, and C. Mathieu, An O(n log n) approximation scheme for Steiner tree in planar graphs, ACM Transactions on Algorithms, vol.5, issue.3, p.31, 2009.

M. Bouvel, V. Grebinski, and G. Kucherov, Combinatorial Search on Graphs Motivated by Bioinformatics Applications: A Brief Survey, Graph-Theoretic Concepts in Computer Science, pp.16-27, 2005.
DOI : 10.1007/11604686_2

URL : https://hal.archives-ouvertes.fr/inria-00000885

R. Gerth-stølting-brodal, C. N. Fagerberg, A. Pedersen, and . Östlin, The complexity of constructing evolutionary trees using experiments, International Colloquium on Automata, Languages and Programming, p.140, 2001.

R. Castro, M. Coates, G. Liang, R. Nowak, and B. Yu, Network Tomography: Recent Developments, Statistical Science, vol.19, issue.3, pp.499-517, 2004.
DOI : 10.1214/088342304000000422

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.6.9713

M. Charikar, V. Guruswami, and A. Wirth, Clustering with qualitative information, Journal of Computer and System Sciences, vol.71, issue.3, pp.360-383, 2005.
DOI : 10.1016/j.jcss.2004.10.012

URL : http://doi.org/10.1016/j.jcss.2004.10.012

G. Chartrand and F. Harary, Planar permutation graphs Annales de l'institut Henri Poincaré (B) Probabilités et Statistiques, pp.433-438, 1967.

D. Chen, L. J. Guibas, J. Hershberger, and J. Sun, Road Network Reconstruction for Organizing Paths, SODA, pp.1309-1320, 2010.
DOI : 10.1137/1.9781611973075.105

S. Choi and J. Kim, Optimal query complexity bounds for finding graphs, STOC, pp.749-758, 2008.

F. Chung, M. Garrett, R. Graham, and D. Shallcross, Distance Realization Problems with Applications to Internet Tomography, Journal of Computer and System Sciences, vol.63, issue.3, pp.432-448, 2001.
DOI : 10.1006/jcss.2001.1785

W. William, J. Cohen, and . Richman, Learning to match and cluster large high-dimensional data sets for data integration, Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining, pp.475-480, 2002.

L. J. Cowen, Compact Routing with Minimum Stretch, Journal of Algorithms, vol.38, issue.1, pp.170-183, 2001.
DOI : 10.1006/jagm.2000.1134

A. Czumaj and A. Lingas, On approximability of the minimum-cost kconnected spanning subgraph problem, Symposium on Discrete Algorithms, pp.281-290, 1999.

L. Dall-'asta, I. Alvarez-hamelin, A. Barrat, A. Vázquez, and A. Vespignani, Exploring networks with traceroute-like probes: Theory and simulations, Theoretical Computer Science, vol.355, issue.1, pp.6-24, 2006.

E. D. Demaine, D. Emanuel, A. Fiat, and N. Immorlica, Correlation clustering in general weighted graphs, Theoretical Computer Science, vol.361, issue.2-3, pp.172-187, 2006.
DOI : 10.1016/j.tcs.2006.05.008

R. Diestel, . Graph, and . Theory, Electronic library of mathematics, 2006.

F. Dorn, E. Penninkx, H. L. Bodlaender, and F. V. Fomin, Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Decompositions, Algorithmica, vol.15, issue.2, pp.790-810, 2010.
DOI : 10.1007/s00453-009-9296-1

URL : http://webdoc.sub.gwdg.de/ebook/serien/ah/UU-CS/2006-006.pdf

T. Eilam, C. Gavoille, and D. Peleg, Compact routing schemes with low stretch factor, Journal of Algorithms, vol.46, issue.2, pp.97-114, 2003.
DOI : 10.1016/S0196-6774(03)00002-6

URL : https://hal.archives-ouvertes.fr/hal-00307506

P. Kapali, R. E. Eswaran, and . Tarjan, Augmentation problems, SIAM Journal on Computing, vol.5, issue.4, pp.653-665, 1976.

P. Fraigniaud and C. Gavoille, Memory requirement for universal routing schemes, Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing , PODC '95, pp.223-230, 1995.
DOI : 10.1145/224964.224989

N. Greg, J. Frederickson, and . Ja-'ja-', Approximation algorithms for several graph augmentation problems, SIAM Journal on Computing, vol.10, issue.2, pp.270-283, 1981.

A. Galluccio and G. Proietti, A Faster Approximation Algorithm for 2-Edge-Connectivity Augmentation, International Symposium on Algorithms and Computation, pp.150-162, 2002.
DOI : 10.1007/3-540-36136-7_14

C. Gavoille and M. Gengler, Space-Efficiency for Routing Schemes of Stretch Factor Three, Journal of Parallel and Distributed Computing, vol.61, issue.5, pp.679-687, 2001.
DOI : 10.1006/jpdc.2000.1705

A. Gionis, H. Mannila, and P. Tsaparas, Clustering aggregation, ACM Transactions on Knowledge Discovery from Data, vol.1, issue.1, 2007.

I. Giotis and V. Guruswami, Correlation clustering with a fixed number of clusters, Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm , SODA '06, pp.1167-1176, 2006.
DOI : 10.1145/1109557.1109686

M. X. Goemans, A. V. Goldberg, S. Plotkin, D. B. Shmoys, É. Tardos et al., Improved approximation algorithms for network design problems, Symposium on Discrete Algorithms, SODA '94, pp.223-232, 1994.

X. Michel, D. P. Goemans, and . Williamson, A general approximation technique for constrained forest problems, SIAM Journal on Computing, vol.24, issue.2, pp.296-317, 1995.

V. Grebinski and G. Kucherov, Optimal Reconstruction of Graphs under the Additive Model, Algorithmica, vol.28, issue.1, pp.104-124, 2000.
DOI : 10.1007/s004530010033

URL : https://hal.archives-ouvertes.fr/inria-00073517

J. Jotun and . Hein, An optimal algorithm to reconstruct trees from additive distance data, Bulletin of Mathematical Biology, vol.51, issue.5, pp.597-603, 1989.

S. Honiden, M. E. Houle, and C. Sommer, Balancing Graph Voronoi Diagrams, 2009 Sixth International Symposium on Voronoi Diagrams, pp.183-191, 2009.
DOI : 10.1109/ISVD.2009.26

K. Jain, A factor 2 approximation algorithm for the generalized Steiner network problem, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280), pp.39-60, 2001.
DOI : 10.1109/SFCS.1998.743495

D. S. Johnson, Approximation algorithms for combinatorial problems, Proceedings of the fifth annual ACM symposium on Theory of computing , STOC '73, pp.256-278, 1974.
DOI : 10.1145/800125.804034

R. Jothi, B. Raghavachari, and S. Varadarajan, A 5/4- approximation algorithm for minimum 2-edge-connectivity, Symposium on Discrete Algorithms, pp.725-734, 2003.

K. Sampath, E. L. Kannan, T. J. Lawler, and . Warnow, Determining the evolutionary tree using experiments, Journal of Algorithms, vol.21, issue.1, pp.26-50, 1996.

M. Kao, A. Lingas, and A. Östlin, Balanced Randomized Tree Splitting with Applications to Evolutionary Tree Constructions, STACS 99, pp.184-196, 1999.
DOI : 10.1007/3-540-49116-3_17

S. Khuller and R. Thurimella, Approximation Algorithms for Graph Augmentation, Journal of Algorithms, vol.14, issue.2, pp.214-225, 1993.
DOI : 10.1006/jagm.1993.1010

S. Khuller and U. Vishkin, Biconnectivity approximations and graph carvings, Journal of the ACM, vol.41, issue.2, pp.214-235, 1994.
DOI : 10.1145/174652.174654

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.56.8290

S. Kim, S. Nowozin, P. Kohli, and C. D. Yoo, Higher-order correlation clustering for image segmentation, Advances in Neural Information Processing Systems, pp.1530-1538, 2011.

V. King, L. Zhang, and Y. Zhou, On the complexity of distancebased evolutionary tree reconstruction, SODA, pp.444-453, 2003.

N. Philip and . Klein, A subset spanner for planar graphs: with application to subset TSP, Symposium on Theory of Computing, pp.749-756, 2006.

N. Philip, S. Klein, and . Mozes, Optimization algorithms for planar graphs

N. Philip, R. Klein, and . Ravi, When cycles collapse: A general approximation technique for constrained two-connectivity problems, Integer Programming and Combinatorial Optimization, pp.39-55, 1993.

G. Kortsarz, R. Krauthgamer, and J. R. Lee, Hardness of Approximation for Vertex-Connectivity Network Design Problems, SIAM Journal on Computing, vol.33, issue.3, pp.704-720, 2004.
DOI : 10.1137/S0097539702416736

G. Kortsarz and Z. Nutov, Approximating minimum cost connectivity problems. Approximation Algorithms and Metahueristics, 2007.
DOI : 10.1201/9781420010749.ch58

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.138.3249

D. R. Martin, C. C. Fowlkes, and J. Malik, Learning to detect natural image boundaries using local brightness, color, and texture cues, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.26, issue.5, pp.530-549, 2004.
DOI : 10.1109/TPAMI.2004.1273918

C. Mathieu and W. Schudy, Correlation Clustering with Noisy Input, Symposium on Discrete Algorithms, pp.712-728, 2010.
DOI : 10.1137/1.9781611973075.58

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.156.5769

H. Mazzawi, Optimally reconstructing weighted graphs using queries, SODA, pp.608-615, 2010.
DOI : 10.1137/1.9781611973075.51

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.215.2588

D. Brendan, . Mckay, C. Nicholas, and . Wormald, Asymptotic enumeration by degree sequence of graphs with degrees o, Combinatorica, vol.11, issue.124, pp.369-382, 1991.

D. Peleg and E. Upfal, A trade-off between space and efficiency for routing tables, Journal of the ACM, vol.36, issue.3, pp.510-530, 1989.
DOI : 10.1145/65950.65953

A. Bruce and . Reed, Algorithmic aspects of tree width, Recent advances in algorithms and combinatorics, pp.85-107, 2003.

M. Resende and P. Pardalos, Handbook of optimization in telecommunications, 2008.
DOI : 10.1007/978-0-387-30165-5

L. Reyzin and N. Srivastava, Learning and Verifying Graphs Using Queries with a Focus on Edge Counting, Algorithmic Learning Theory, pp.285-297, 2007.
DOI : 10.1016/j.ipl.2006.08.013

L. Reyzin and N. Srivastava, On the longest path algorithm for reconstructing trees from distance matrices, Information Processing Letters, vol.101, issue.3, pp.98-100, 2007.
DOI : 10.1016/j.ipl.2006.08.013

C. Swamy, Correlation clustering: maximizing agreements via semidefinite programming, Symposium on Discrete Algorithms, pp.526-527, 2004.

F. Tarissan, M. Latapy, and C. Prieur, Efficient Measurement of Complex Networks Using Link Queries, IEEE INFOCOM Workshops 2009, pp.254-259, 2009.
DOI : 10.1109/INFCOMW.2009.5072135

URL : https://hal.archives-ouvertes.fr/hal-01217889

M. Thorup and U. Zwick, Compact routing schemes, Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures , SPAA '01, pp.1-10, 2001.
DOI : 10.1145/378580.378581

M. S. Waterman, T. F. Smith, W. A. Singh, and . Beyer, Additive evolutionary trees, Journal of Theoretical Biology, vol.64, issue.2, pp.199-213, 1977.
DOI : 10.1016/0022-5193(77)90351-4

D. P. Williamson, M. X. Goemans, M. Mihail, and V. V. Vazirani, A primal-dual approximation algorithm for generalized Steiner network problems, Proceedings of the twenty-fifth annual ACM symposium on Theory of computing , STOC '93, pp.435-454, 1995.
DOI : 10.1145/167088.167268

J. Yarkony, A. Ihler, C. Charless, and . Fowlkes, Fast Planar Correlation Clustering for Image Segmentation, European Conference on Computer Vision, pp.568-581, 2012.
DOI : 10.1007/978-3-642-33783-3_41

URL : http://arxiv.org/abs/1208.0378