January 01, 1990 article Open access The complexity of finding two disjoint paths with min-max objective function Discrete Applied Mathematics DOI: 10.1016/0166-218x(90)90024-7 Full text (OA) OpenAlex Authors 0 Author list not loaded yet. Cited by 2 stored of 152 Search Sort Most cited Newest Oldest Patent citations Title Any typearticle review book-chapter conference-paper preprint dissertation book dataset other Any fieldAgricultural and Biological Sciences Arts and Humanities Biochemistry, Genetics and Molecular Biology Business, Management and Accounting Chemical Engineering Chemistry Computer Science Decision Sciences Dentistry Earth and Planetary Sciences Economics, Econometrics and Finance Energy Engineering Environmental Science Health Professions Immunology and Microbiology Materials Science Mathematics Medicine Neuroscience Nursing Pharmacology, Toxicology and Pharmaceutics Physics and Astronomy Psychology Social Sciences Veterinary Open access The Complexity of Graph Exploration Games 2025 Lecture notes in computer science conference-paper Computer Science Optimization and Search Problems 0 citations Min–max–min robustness for combinatorial problems with discrete budgeted uncertainty 2020 Discrete Applied Mathematics article Decision Sciences Risk and Portfolio Optimization Open access 13 citations 2 results References 0