August 06, 2008 article Open access Commitment under uncertainty: Two-stage stochastic matching problems Theoretical Computer Science DOI: 10.1016/j.tcs.2008.08.010 Full text (OA) OpenAlex Authors 0 Author list not loaded yet. Cited by 3 stored of 41 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 Complexity of the Directed Robust b‐Matching Problem and Its Variants on Different Graph Classes 2025 Networks article Computer Science Complexity and Algorithms in Graphs Open access 0 citations Technische Ansätze, Konzepte und Herausforderungen beim Einsatz von KI in der prähospitalen Telenotfallmedizin 2025 Springer eBooks book-chapter Medicine Artificial Intelligence in Healthcare and Education 0 citations Robust two-stage combinatorial optimization problems under discrete demand uncertainties and consistent selection constraints 2024 Discrete Applied Mathematics article Computer Science Complexity and Algorithms in Graphs 5 citations 3 results References 0