Information Complexity of Online Problems

• A survey of online knapsack problems

  2025 Discrete Applied Mathematics article Computer Science Optimization and Search Problems Open access

  3

  citations
• Online knapsack with removal and recourse

  2025 Journal of Computer and System Sciences article Computer Science Optimization and Search Problems Open access

  1

  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
• Online Knapsack with Removal and Recourse

  2023 Lecture notes in computer science conference-paper Computer Science Optimization and Search Problems Open access

  6

  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
• Exploring sparse graphs with advice

  2022 Information and Computation article Computer Science Optimization and Search Problems Open access

  7

  citations
• Online Node- and Edge-Deletion Problems with Advice

  2021 Algorithmica article Computer Science Optimization and Search Problems Open access

  7

  citations
• On the advice complexity of the online dominating set problem

  2021 Theoretical Computer Science article Computer Science Optimization and Search Problems Open access

  3

  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

10 results