, , 1988.
Applications of network optimization, Handbooks in Operations Research and Management Science, vol.7, pp.1-83, 1995. ,
Decision trees for geometric models, Int. J. Comput. Geometry Appl, vol.8, issue.3, pp.343-364, 1998. ,
The multiplicative weights update method: a meta-algorithm and applications, Theory of Computing, vol.8, pp.121-164, 2012. ,
Physarum can compute shortest paths: Convergence proofs and complexity bounds, International Colloquium on Automata, Languages, and Programming, pp.472-483, 2013. ,
Pooling or sampling: Collective dynamics for electrical flow estimation, Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, pp.1576-1584, 2018. ,
URL : https://hal.archives-ouvertes.fr/hal-02002536
The cost of searching in general trees versus complete binary trees, 1997. ,
The bayesian learner is optimal for noisy binary search (and pretty good for quantum as well), 49th Annual IEEE Symposium on Foundations of Computer Science, FOCS, pp.221-230, 2008. ,
, Graphes et hypergraphes. Dunod, 1970.
Clutter decomposition and monotonic boolean functions. Annals of the New, 1970. ,
On the composition and decomposition of clutters, Journal of Combinatorial Theory, Series B, vol.11, issue.3, pp.234-245, 1971. ,
The complexity of modular decomposition of boolean functions, Discrete Applied Mathematics, vol.149, issue.1-3, pp.1-13, 2005. ,
An algorithm for the modular decomposition of hypergraphs, J. Algorithms, vol.32, issue.2, pp.65-86, 1999. ,
The complexity of the matching-cut problem for planar graphs and other graph classes, Journal of Graph Theory, vol.62, issue.2, pp.109-126, 2009. ,
Into the square: On the complexity of some quadratic-time solvable problems, Electr. Notes Th. Comp. Sci, vol.322, pp.51-67, 2016. ,
URL : https://hal.archives-ouvertes.fr/hal-01390131
Interactive graph cuts for optimal boundary & region segmentation of objects in nd images, Proceedings eighth IEEE international conference on computer vision. ICCV, vol.1, pp.105-112, 2001. ,
Searching in random partially ordered sets, Theor. Comput. Sci, vol.321, issue.1, pp.41-57, 2004. ,
A note on computing set overlap classes, Inf. Process. Lett, vol.108, issue.4, pp.186-191, 2008. ,
URL : https://hal.archives-ouvertes.fr/lirmm-00325371
, Partitive hypergraphs. Discrete Mathematics, vol.37, pp.35-50, 1981.
Electrical flows, laplacian systems, and faster approximation of maximum flow in undirected graphs, Proceedings of the forty-third annual ACM symposium on Theory of computing, pp.273-282, 2011. ,
Recognizing decomposable graphs, Journal of Graph Theory, vol.8, issue.1, pp.51-53, 1984. ,
On the complexity of searching in trees and partially ordered structures, Theor. Comput. Sci, vol.412, issue.50, pp.6879-6896, 2011. ,
Eduardo Sany Laber, and Caio Dias Valentim. The binary identification problem for weighted trees, Theor. Comput. Sci, vol.459, pp.100-112, 2012. ,
On the tree search problem with non-uniform costs, 2014. ,
Complement reducible graphs, Discrete Applied Mathematics, vol.3, issue.3, pp.163-174, 1981. ,
A monadic second-order definition of the structure of convex hypergraphs, Inf. Comput, vol.178, issue.2, pp.391-411, 2002. ,
Parallel algorithms for hierarchical clustering and applications to split decomposition and parity graph recognition, J. Algorithms, vol.36, issue.2, pp.205-240, 2000. ,
Edge ranking of weighted trees, Discrete Applied Mathematics, vol.154, issue.8, pp.1198-1209, 2006. ,
Edge ranking and searching in partial orders, Discrete Applied Mathematics, vol.156, issue.13, pp.2493-2500, 2008. ,
Efficient parallel query processing by graph ranking, Fundam. Inform, vol.69, issue.3, pp.273-285, 2006. ,
Vertex rankings of chordal graphs and weighted trees, Inf. Process. Lett, vol.98, issue.3, pp.96-100, 2006. ,
A framework for searching in graphs in the presence of errors, 2018. ,
, Random walks and electric networks, vol.22, 1984.
Network-thinking: Graphs to analyze microbial complexity and evolution, Trends Microbiol, vol.24, issue.3, pp.224-237, 2016. ,
URL : https://hal.archives-ouvertes.fr/hal-01300043
Bipartite network analysis of gene sharings in the microbial world, Mol. Biol Evol, 2018. ,
URL : https://hal.archives-ouvertes.fr/hal-01798030
Theoretical improvements in algorithmic efficiency for network flow problems, Journal of the ACM (JACM), vol.19, issue.2, pp.248-264, 1972. ,
Deterministic and probabilistic binary search in graphs, Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2016, pp.519-532, 2016. ,
Computing with noisy information, SIAM J. Comput, vol.23, issue.5, pp.1001-1018, 1994. ,
Maximal flow through a network, Canadian Journal of Mathematics, vol.8, pp.399-404, 1956. ,
Parameterized algorithms for modular-width, International Symposium on Parameterized and Exact Computation, pp.163-176, 2013. ,
Transitiv orientierbare Graphen, Acta Mathematica Academiae Scientiarum Hungaricae, vol.18, pp.25-66, 1967. ,
Near-optimal distributed maximum flow, Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, pp.81-90, 2015. ,
Lifosearch: A min-max theorem and a searching game for cycle-rank and tree-depth, Discrete Applied Mathematics, vol.160, issue.15, pp.2089-2097, 2012. ,
A new approach to the maximumflow problem, Journal of the ACM (JACM), vol.35, issue.4, pp.921-940, 1988. ,
A simple lineartime modular decomposition algorithm for graphs, using order extension, SWAT, 9th Scandinavian Workshop on Algorithm Theory, pp.187-198, 2004. ,
URL : https://hal.archives-ouvertes.fr/hal-00159601
Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing, Theor. Comput. Sci, vol.234, issue.1-2, pp.59-84, 2000. ,
A survey of the algorithmic aspects of modular decomposition, Computer Science Review, vol.4, issue.1, pp.41-59, 2010. ,
Searching in dynamic tree-like partial orders, Algorithms and Data Structures -12th International Symposium, pp.512-523, 2011. ,
Decomposition of perfect graphs, Journal of Combinatorial Theory, Series B, vol.43, issue.1, pp.70-94, 1987. ,
Optimal node ranking of trees, Inf. Process. Lett, vol.28, issue.5, pp.225-229, 1988. ,
Parallel assembly of modular products -an analysis, 1988. ,
Graph decomposition for undirected graphs, Proc. 3rd Southeastern International Conference on Combinatorics, Graph Theory, and Computing, pp.281-290, 1972. ,
Noisy binary search and its applications, Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp.881-890, 2007. ,
, Ordered colourings. Discrete Mathematics, vol.142, issue.1-3, pp.141-154, 1995.
A nearly-m log n time solver for sdd linear systems, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, pp.590-598, 2011. ,
On binary searching with nonuniform costs, SIAM J. Comput, vol.31, issue.4, pp.1022-1047, 2002. ,
An approximation algorithm for binary searching in trees, Algorithmica, vol.59, issue.4, pp.601-620, 2011. ,
Fast searching in trees, Electronic Notes in Discrete Mathematics, vol.7, pp.90-93, 2001. ,
On the hardness of the minimum height decision tree problem, Discrete Applied Mathematics, vol.144, issue.1-2, pp.209-212, 2004. ,
Optimal edge ranking of trees in linear time, Algorithmica, vol.30, issue.1, pp.12-33, 2001. ,
A new approach to computing maximum flows using electrical flows, Proceedings of the forty-fifth annual ACM symposium on Theory of computing, pp.755-764, 2013. ,
Markov chains and mixing times, vol.107, 2017. ,
Locality in distributed graph algorithms, SIAM Journal on Computing, vol.21, issue.1, pp.193-201, 1992. ,
Searching ordered structures, J. Algorithms, vol.6, issue.1, pp.86-103, 1985. ,
Computational models and task scheduling for parallel sparse cholesky factorization, Parallel Computing, vol.3, issue.4, pp.327-342, 1986. ,
The role of elimination trees in sparse factorization, SIAM. J. Matrix Anal. & Appl, vol.11, issue.1, pp.134-172, 1990. ,
Random walks on graphs: A survey, Combinatorics, Paul erdos is eighty, vol.2, issue.1, pp.1-46, 1993. ,
Computing maximum flow with augmenting electrical flows, 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS), pp.593-602, 2016. ,
A certifying algorithm for the consecutive-ones property, SODA, Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp.768-777, 2004. ,
Linear-time modular decomposition of directed graphs, Discrete Applied Mathematics, vol.145, issue.2, pp.198-209, 2005. ,
Matching cutsets in graphs, Journal of Graph Theory, vol.13, issue.5, pp.527-536, 1989. ,
Finding an optimal tree searching strategy in linear time, Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp.1096-1105, 2008. ,
Substitution decomposition for discrete structures and connections with combinatorial optimization, Proceedings of the Workshop on Algebraic Structures in Operations Research, pp.257-355, 1984. ,
Algorithmic aspects of the substitution decomposition in optimization over relations, set systems and boolean functions, Annals of Operation Research, vol.4, pp.195-225, 1985. ,
Tree-depth, subgraph coloring and homomorphism bounds, Eur. J. Comb, vol.27, issue.6, pp.1022-1041, 2006. ,
URL : https://hal.archives-ouvertes.fr/hal-00023821
Generalization of binary search: Searching in trees and forest-like partial orders, 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), pp.379-388, 2006. ,
Distributed Computing: A Locality-sensitive Approach, Society for Industrial and Applied Mathematics, 2000. ,
The complexity of optimal elimination trees, 1988. ,
Coping with errors in binary search procedures, J. Comput. Syst. Sci, vol.20, issue.3, pp.396-404, 1980. ,
Forbidden subgraph decomposition. Discrete mathematics, vol.247, pp.159-168, 2002. ,
URL : https://hal.archives-ouvertes.fr/hal-00442415
Optimal node ranking of trees in linear time, Inf. Process. Lett, vol.33, issue.2, pp.91-96, 1989. ,
, Combinatorial optimization: polyhedra and efficiency, 2003.
Speeding up graph clustering via modular decomposition based compression, Proceedings of the 28th Annual ACM Symposium on Applied Computing, SAC '13, pp.156-163, 2013. ,
Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems, Proceedings of the STOC, vol.4, 2004. ,
Searching in 2-dimensional partial orders, J. Algorithms, vol.8, issue.1, pp.95-105, 1987. ,
Optimal binary search trees with costs depending on the access paths, Theor. Comput. Sci, vol.290, issue.3, pp.1799-1814, 2003. ,
Simpler linear-time modular decomposition via recursive factorizing permutations, Automata, Languages and Programming, 35th International Colloquium, ICALP, pp.634-645, 2008. ,
The design of approximation algorithms, 2011. ,