EDBT 2026 Demo / reviewers in the wild / expert
Petar Dapic
dblp:143/2865
· DBLP profile ↗
2ranked-venue papers
2as first author
0since 2021 · last 2017
0000-0001-5800-1709ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 2 · 2 first-author
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Theoretical computer science
1 paper |
Computational complexity · 50% Graph algorithms and graph theory · 50% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Computational complexity
constraint satisfaction |
0.2 | 1 | 2014 | QCSP on Semicomplete Digraphs · ICALP (1) 2014 |
Graph algorithms and graph theory
digraph |
0.2 | 1 | 2014 | QCSP on Semicomplete Digraphs · ICALP (1) 2014 |
Methods — techniques the papers use, named apart from their topics
complexity classification · 0.2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2017 | Quantified Constraint Satisfaction Problem on Semicomplete DigraphsabstractWe study the (non-uniform) quantified constraint satisfaction problem QCSP( H ) as H ranges over semicomplete digraphs. We obtain a complexity-theoretic trichotomy: QCSP( H ) is either in P, is NP-complete, or is Pspace-complete. The largest part of our work is the algebraic classification of precisely which semicomplete digraphs enjoy only essentially unary polymorphisms, which is combinatorially interesting in its own right. Petar Dapic, Petar Markovic, Barnaby Martin |
ACM Trans. Comput. Log. | 1 |
| 2014 | QCSP on Semicomplete Digraphs
Petar Dapic, Petar Markovic, Barnaby Martin |
ICALP (1) | 1 |