Demo Data from EDBT 2026 / reviewers in the wild / expert
Eric McDermid
dblp:23/5794
· DBLP profile ↗
14ranked-venue papers
4as first author
0since 2021 · last 2016
0009-0004-5222-9285ORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 12 · 4 first-authorDatabases, data management, data science and information retrieval · 2 · 1 first-authorArtificial intelligence and machine learning · 1Security and privacy · 1Applied, interdisciplinary, general and emerging computing · 1
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
2 papers |
Algorithmic game theory and mechanism design · 38% Coding theory · 28% Graph algorithms and graph theory · 24% |
Topics — the 8 heaviest of 8, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Coding theory › lattice theory
distributive lattice |
0.1 | 1 | 2011 | Center Stable Matchings and Centers of Cover Graphs of Distributive Lattices · ICALP (1) 2011 |
Graph algorithms and graph theory › graph theory
graph covering |
0.1 | 1 | 2011 | Center Stable Matchings and Centers of Cover Graphs of Distributive Lattices · ICALP (1) 2011 |
Coding theory
lattice theory |
0.1 | 1 | 2011 | Center Stable Matchings and Centers of Cover Graphs of Distributive Lattices · ICALP (1) 2011 |
Algorithmic game theory and mechanism design › matching
matching theory |
0.1 | 1 | 2011 | Center Stable Matchings and Centers of Cover Graphs of Distributive Lattices · ICALP (1) 2011 |
Algorithmic game theory and mechanism design › matching
stable matching |
0.1 | 1 | 2011 | Center Stable Matchings and Centers of Cover Graphs of Distributive Lattices · ICALP (1) 2011 |
Approximation and online algorithms
approximation algorithms |
0.1 | 1 | 2009 | A 3/2-Approximation Algorithm for General Stable Marriage · ICALP (1) 2009 |
Algorithmic game theory and mechanism design
matching |
0.1 | 1 | 2009 | A 3/2-Approximation Algorithm for General Stable Marriage · ICALP (1) 2009 |
Graph algorithms and graph theory › graph matching › matching algorithms
stable marriage |
0.1 | 1 | 2009 | A 3/2-Approximation Algorithm for General Stable Marriage · ICALP (1) 2009 |
Methods — techniques the papers use, named apart from their topics
approximation algorithm · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2016 | Eccentricity, center and radius computations on the cover graphs of distributive lattices with applications to stable matchings
Christine T. Cheng, Eric McDermid, Ichiro Suzuki |
Discret. Appl. Math. | 2 |
| 2015 | A General Reduction Theorem with Applications to Pathwidth and the Complexity of MAX 2-CSP
Keith Edwards, Eric McDermid |
Algorithmica | 2 |
| 2014 | Entity resolution using inferred relationships and behaviorabstractWe present a method for entity resolution that infers relationships between observed identities and uses those relationships to aid in mapping identities to underlying entities. We also introduce the idea of using graphlets for entity resolution. Graphlets are collections of small graphs that can be used to characterize the “role” of a node in a graph. The idea is that graphlets can provide a richer set of features to characterize identities. We validate our method on standard author datasets, and we further evaluate our method using data collected from Twitter. We find that inferred relationships and graphlets are useful for entity resolution. Jonathan Mugan, Ranga Chari, Laura Hitt, Eric McDermid, Marsha Sowell, Yuan Qu, Thayne Coffman |
IEEE BigData | 4 |
| 2014 | Sex-Equal Stable Matchings: Complexity and Exact Algorithms
Eric McDermid, Robert W. Irving |
Algorithmica | 1 |
| 2014 | Matching with sizes (or scheduling with processing set restrictions)
Péter Biró 0001, Eric McDermid |
Discret. Appl. Math. | 2 |
| 2013 | Identifying groups of interest through temporal analysis and event response monitoringabstractWe present a method for finding groups of interest in large social networks. A temporal group detection algorithm identifies tightly connected groups by analyzing communications as they unfold over time. Since the number of groups found through temporal group detection may be too large to allow for manual analysis of their behavior, we also present an algorithm to identify groups of interest within an existing set of groups. This algorithm works by observing how groups react to key events and finds groups of interest by noting which groups respond anomalously. We demonstrate this approach on two social media datasets collected from Twitter. The first dataset involves tweets from Afghanistan when Afghanistan signed a letter of cooperation with India. The second dataset involves tweets surrounding the death of Steve Jobs. In both cases, our algorithm was able to identify appropriate groups. Jonathan Mugan, Eric McDermid, Abbey McGrew, Laura Hitt |
ISI | 2 |
| 2012 | "Almost stable" matchings in the Roommates problem with bounded preference lists
Péter Biró 0001, David F. Manlove, Eric McDermid |
Theor. Comput. Sci. | 3 |
| 2011 | Center Stable Matchings and Centers of Cover Graphs of Distributive Lattices
Christine T. Cheng, Eric McDermid, Ichiro Suzuki |
ICALP (1) | 2 |
| 2011 | Planarization and Acyclic Colorings of Subcubic Claw-Free Graphs
Christine T. Cheng, Eric McDermid, Ichiro Suzuki |
WG | 2 |
| 2010 | Three-Sided Stable Matchings with Cyclic Preferences
Péter Biró 0001, Eric McDermid |
Algorithmica | 2 |
| 2009 | Popular Matchings: Structure and Algorithms
Eric McDermid, Robert W. Irving |
COCOON | 1 |
| 2009 | A 3/2-Approximation Algorithm for General Stable Marriage
Eric McDermid |
ICALP (1) | 1 |
| 2008 | A unified approach to finding good stable matchings in the hospitals/residents setting
Christine T. Cheng, Eric McDermid, Ichiro Suzuki |
Theor. Comput. Sci. | 2 |
| 2007 | Hardness results on the man-exchange stable marriage problem with short preference lists
Eric McDermid, Christine T. Cheng, Ichiro Suzuki |
Inf. Process. Lett. | 1 |