- Sprache
-
Englisch
- Identifier
-
1267705965
Beteiligte Personen und Organisationen
Böckenhauer, Hans-Joachim
Burjons, Elisabet
Raszyk, Martin
Rossmanith, Peter
Burjons, Elisabet
Raszyk, Martin
Rossmanith, Peter
- DOI
-
10.18154/RWTH-2022-08104
- URN
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
27.10.2022, 11:05 MESZ
Beteiligte
- Böckenhauer, Hans-Joachim
- Burjons, Elisabet
- Raszyk, Martin
- Rossmanith, Peter
Ähnliche Objekte (12)
Online Simple Knapsack with Reservation Costs
Lower Bounds for Conjunctive and Disjunctive Turing Kernels
An Open Pouring Problem
Hard Problems on Random Graphs
Extensions of secretary problems towards submodular objectives and temporal arrival
Randomization in Non-Uniform Finite Automata
Online Node- and Edge-Deletion Problems with Advice
Motif Counting in Preferential Attachment Graphs
Hardness of FO Model-Checking on Random Graphs
Maximum Shallow Clique Minors in Preferential Attachment Graphs Have Polylogarithmic Size
First-Order Model-Checking in Random Graphs and Complex Networks
An Efficient Fixed-Parameter Algorithm for the 2-Plex Bipartition Problem
Online Simple Knapsack with Reservation Costs
Lower Bounds for Conjunctive and Disjunctive Turing Kernels
An Open Pouring Problem
Hard Problems on Random Graphs
Extensions of secretary problems towards submodular objectives and temporal arrival
Randomization in Non-Uniform Finite Automata
Online Node- and Edge-Deletion Problems with Advice
Motif Counting in Preferential Attachment Graphs
Hardness of FO Model-Checking on Random Graphs
Maximum Shallow Clique Minors in Preferential Attachment Graphs Have Polylogarithmic Size
First-Order Model-Checking in Random Graphs and Complex Networks
An Efficient Fixed-Parameter Algorithm for the 2-Plex Bipartition Problem
Online Simple Knapsack with Reservation Costs
Lower Bounds for Conjunctive and Disjunctive Turing Kernels
An Open Pouring Problem
Hard Problems on Random Graphs
Extensions of secretary problems towards submodular objectives and temporal arrival
Randomization in Non-Uniform Finite Automata
Online Node- and Edge-Deletion Problems with Advice
Motif Counting in Preferential Attachment Graphs
Hardness of FO Model-Checking on Random Graphs
Maximum Shallow Clique Minors in Preferential Attachment Graphs Have Polylogarithmic Size
First-Order Model-Checking in Random Graphs and Complex Networks