activity
20192025
most citedStubborn Set Reduction for Two-Player Reachability Games

5 citations · 6 across the 4 of their papers we have counts for

collaborators
Showing 2020Show all

1 paper · 1 filter

cs.DC2020★ 1 cited

Near Optimal Task Graph Scheduling with Priced Timed Automata and Priced Timed Markov Decision Processes

Anne Ejsing, Martin Jensen, Marco Muñiz +2

Task graph scheduling is a relevant problem in computer science with application to diverse real world domains. Task graph scheduling suffers from a combinatorial explosion and thu…