April 03, 2009 article Measuring the problem-relevant information in input RAIRO - Theoretical Informatics and Applications DOI: 10.1051/ita/2009012 OpenAlex Authors 0 Author list not loaded yet. Cited by 6 stored of 72 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 A survey of online knapsack problems 2025 Discrete Applied Mathematics article Computer Science Optimization and Search Problems Open access 3 citations Online Unbounded Knapsack 2025 Theory of Computing Systems article Computer Science Optimization and Search Problems Open access 2 citations The Advice Complexity of Delayed F-Node-Deletion Problems and of Disconnected Delayed H-Edge-Deletion Problems 2024 SSRN Electronic Journal preprint Computer Science Advanced Graph Theory Research Open access 0 citations Advice Complexity Bounds for Online Delayed $$\mathcal{F}$$-Node-, H-Node- and H-Edge-Deletion Problems 2023 Lecture notes in computer science conference-paper Computer Science Advanced Graph Theory Research 3 citations Online Node- and Edge-Deletion Problems with Advice 2021 Algorithmica article Computer Science Optimization and Search Problems Open access 7 citations Further Results on Online Node- and Edge-Deletion Problems with Advice 2020 Lecture notes in computer science conference-paper Computer Science Optimization and Search Problems Open access 1 citations 6 results References 0