Gabriele Röger

Orcid: 0000-0002-0092-2107

According to our database1, Gabriele Röger authored at least 35 papers between 2006 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Encouraging AI Adoption by SMEs: Opportunities and Contributions by the ICT49 Project Cluster.
Proceedings of the 14th International Conference on Information, 2023

2022
On Producing Shortest Cost-Optimal Plans.
Proceedings of the Fifteenth International Symposium on Combinatorial Search, 2022

Cost Partitioning Heuristics for Stochastic Shortest Path Problems.
Proceedings of the Thirty-Second International Conference on Automated Planning and Scheduling, 2022

2020
An Atom-Centric Perspective on Stubborn Sets.
Proceedings of the Thirteenth International Symposium on Combinatorial Search, 2020

Lagrangian Decomposition for Classical Planning (Extended Abstract).
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

2019
Theoretical Foundations for Structural Symmetries of Lifted PDDL Tasks.
Proceedings of the Twenty-Ninth International Conference on Automated Planning and Scheduling, 2019

Lagrangian Decomposition for Optimal Cost Partitioning.
Proceedings of the Twenty-Ninth International Conference on Automated Planning and Scheduling, 2019

2018
Planning and Operations Research (Dagstuhl Seminar 18071).
Dagstuhl Reports, 2018

Inductive Certificates of Unsolvability for Domain-Independent Planning.
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

Symmetry-Based Task Reduction for Relaxed Reachability Analysis.
Proceedings of the Twenty-Eighth International Conference on Automated Planning and Scheduling, 2018

A Proof System for Unsolvable Planning Tasks.
Proceedings of the Twenty-Eighth International Conference on Automated Planning and Scheduling, 2018

2017
Optimal Solutions to Large Logistics Planning Domain Problems.
Proceedings of the Tenth International Symposium on Combinatorial Search, 2017

Towards Certified Unsolvability in Classical Planning.
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

Unsolvability Certificates for Classical Planning.
Proceedings of the Twenty-Seventh International Conference on Automated Planning and Scheduling, 2017

2016
Correlation Complexity of Classical Planning Domains.
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

2015
Finding and Exploiting LTL Trajectory Constraints in Heuristic Search.
Proceedings of the Eighth Annual Symposium on Combinatorial Search, 2015

Heuristics for Cost-Optimal Classical Planning Based on Linear Programming.
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

On the Expressive Power of Non-Linear Merge-and-Shrink Representations.
Proceedings of the Twenty-Fifth International Conference on Automated Planning and Scheduling, 2015

From Non-Negative to General Operator Cost Partitioning.
Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

2014
Planning techniques and the action language golog (Planungstechniken und die Aktionssprache Golog)
PhD thesis, 2014

Optimal Planning in the Presence of Conditional Effects: Extending LM-Cut with Context Splitting.
Proceedings of the ECAI 2014 - 21st European Conference on Artificial Intelligence, 18-22 August 2014, Prague, Czech Republic, 2014

LP-Based Heuristics for Cost-Optimal Planning.
Proceedings of the Twenty-Fourth International Conference on Automated Planning and Scheduling, 2014

2013
Preface.
Proceedings of the Sixth Annual Symposium on Combinatorial Search, 2013

SoCS 2013 Organization.
Proceedings of the Sixth Annual Symposium on Combinatorial Search, 2013

Getting the Most Out of Pattern Databases for Classical Planning.
Proceedings of the IJCAI 2013, 2013

2012
Using the Context-Enhanced Additive Heuristic for Temporal and Numeric Planning.
Proceedings of the Towards Service Robots for Everyday Environments, 2012

Platas - Integrating Planning and the Action Language Golog.
Künstliche Intell., 2012

Non-Optimal Multi-Agent Pathfinding Is Solved (Since 1984).
Proceedings of the Multiagent Pathfinding, Papers from the 2012 AAAI Workshop, 2012

2010
Relative-Order Abstractions for the Pancake Problem.
Proceedings of the ECAI 2010, 2010

The More, the Merrier: Combining Heuristic Estimators for Satisficing Planning.
Proceedings of the 20th International Conference on Automated Planning and Scheduling, 2010

2009
Using the Context-enhanced Additive Heuristic for Temporal and Numeric Planning.
Proceedings of the 19th International Conference on Automated Planning and Scheduling, 2009

2008
On the Relative Expressiveness of ADL and Golog: The Last Piece in the Puzzle.
Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Eleventh International Conference, 2008

How Good is Almost Perfect?.
Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence, 2008

2007
Expressiveness of ADL and Golog: Functions Make a Difference.
Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence, 2007

2006
Aproximation Properties of Planning Benchmarks.
Proceedings of the ECAI 2006, 17th European Conference on Artificial Intelligence, August 29, 2006


  Loading...