Demo Data from VLDB 2026 / reviewers in the wild / expert
Jarett Schwartz
dblp:51/8173
· DBLP profile ↗
3ranked-venue papers
0as first author
0since 2021 · last 2013
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 3
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 |
Automated reasoning and model checking · 25% Computational complexity · 25% Graph algorithms and graph theory · 25% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Computational complexity › complexity of reasoning
first-order model checking |
0.2 | 1 | 2013 | FO Model Checking of Interval Graphs · ICALP (2) 2013 |
Graph algorithms and graph theory
graph classes |
0.2 | 1 | 2013 | FO Model Checking of Interval Graphs · ICALP (2) 2013 |
Computational geometry › intersection graphs
interval graphs |
0.2 | 1 | 2013 | FO Model Checking of Interval Graphs · ICALP (2) 2013 |
Automated reasoning and model checking
model checking |
0.2 | 1 | 2013 | FO Model Checking of Interval Graphs · ICALP (2) 2013 |
Methods — techniques the papers use, named apart from their topics
fixed-parameter tractability · 0.2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2013 | FO Model Checking of Interval Graphs
Robert Ganian, Petr Hlinený, Daniel Král, Jan Obdrzálek, Jarett Schwartz, Jakub Teska |
ICALP (2) | 5 |
| 2012 | Constructing partial words with subword complexities not achievable by full words
Francine Blanchet-Sadri, Aleksandar Chakarov, Lucas Manuelli, Jarett Schwartz, Slater Stich |
Theor. Comput. Sci. | 4 |
| 2010 | Binary De Bruijn Partial Words with One Hole
Francine Blanchet-Sadri, Jarett Schwartz, Slater Stich, Benjamin J. Wyatt |
TAMC | 2 |