Sebastian Ordyniak

27 papers · 2017–2026 · 3 conferences · across top CS/AI conferences

Achievements

🐝 Cross-Pollinator (5) 🐣 Hot Topic Early Bird 🗺️ Taxonomy Completionist (29) 🌉 Interdisciplinary Bridge 🧭 Keyword Pioneer 🌈 Renaissance Researcher (7) 🌍 Conference Polyglot (3) 🏃 Academic Marathon (7) 🤝 Dynamic Duo (12) 🔬 Deep Specialist (14) 🧬 Topic Evolution 🏆 Keyword Champion (7) 🗃️ Keyword Collector (95) 🚀 Conference Pioneer 🔥 Unstoppable (8) 💎 Century Club (26) ⚡ Prolific Year (8)

Conferences

AAAI (13) IJCAI (12) ICML (2)

Top co-authors

Stefan Szeider (12) Robert Ganian (12) Eduard Eiben (11) Peter Jonsson (5) Thekla Hamm (4) Giacomo Paesani (4) George Osipov (4) Dusan Knop (3) Iyad Kanj (3) Mateusz Rychlicki (3)

Keywords

parameterized complexity (13) fixed-parameter tractable (7) fixed-parameter tractability (7) decision tree (5) constraint satisfaction (3) combinatorial optimization (3) parameterized algorithm (3) complexity analysis (3) fixed-parameter algorithm (2) temporal reasoning (2) interpretable model (2) fair division (2) algorithm design (2) model interpretability (2) rank minimization (2) matrix completion (2) np-hard problem (2) integer linear programming (2) agent interaction (1) machine learning (1)

Papers

Computing Probabilistic Explanations for ML Models: Fixed-Parameter Algorithms AAAI 2026

Learning Small Decision Trees for Data of Low Rank-Width AAAI 2024

Solving Quantified Boolean Formulas with Few Existential Variables IJCAI 2024

A General Theoretical Framework for Learning Smallest Interpretable Models AAAI 2024

The Computational Complexity of Concise Hypersphere Classification ICML 2023

Learning Small Decision Trees with Large Domain IJCAI 2023

The Parameterized Complexity of Finding Concise Local Explanations IJCAI 2023

Resolving Inconsistencies in Simple Temporal Problems: A Parameterized Approach AAAI 2022

The Complexity of Envy-Free Graph Cutting IJCAI 2022

Solving Infinite-Domain CSPs Using the Patchwork Property AAAI 2021

The Complexity of Object Association in Multiple Object Tracking AAAI 2021

The Parameterized Complexity of Clustering Incomplete Data AAAI 2021

Parameterized Algorithms for MILPs with Small Treedepth AAAI 2021

The Parameterized Complexity of Connected Fair Division IJCAI 2021

Backdoor DNFs IJCAI 2021

Disjunctive Temporal Problems under Structural Restrictions AAAI 2021

Parameterized Complexity of Small Decision Tree Learning AAAI 2021

On the Parameterized Complexity of Clustering Incomplete Data into Subspaces of Small Rank AAAI 2020

Parameterized Complexity of Envy-Free Resource Allocation in Social Networks AAAI 2020

A Refined Understanding of Cost-optimal Planning with Polytree Causal Graphs IJCAI 2019

Solving Integer Quadratic Programming via Explicit and Structural Restrictions AAAI 2019

A Structural Approach to Activity Selection IJCAI 2018

Novel Structural Parameters for Acyclic Planning Using Tree Embeddings IJCAI 2018

Parameterized Algorithms for the Matrix Completion Problem ICML 2018

Unary Integer Linear Programming with Structural Restrictions IJCAI 2018

A SAT Approach to Branchwidth IJCAI 2017

Solving Integer Linear Programs with a Small Number of Global Variables and Constraints IJCAI 2017