Demo Data from SIGIR 2026 / reviewers in the wild / expert
Elena Losievskaja
dblp:75/4115
· DBLP profile ↗
7ranked-venue papers
0as first author
0since 2021 · last 2016
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 7
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
3 papers |
Graph algorithms and graph theory · 23% Mathematical optimization · 22% Computational complexity · 22% |
Topics — the 9 heaviest of 9, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Graph algorithms and graph theory
independent set |
0.1 | 1 | 2010 | Streaming Algorithms for Independent Sets · ICALP (1) 2010 |
Algorithms and data structures › data streams
streaming algorithms |
0.1 | 1 | 2010 | Streaming Algorithms for Independent Sets · ICALP (1) 2010 |
Computational complexity › parameterized complexity
fixed-parameter tractability |
0.1 | 1 | 2009 | Distortion Is Fixed Parameter Tractable · ICALP (1) 2009 |
Combinatorics and discrete mathematics › hypergraph
hypergraph independent set |
0.1 | 1 | 2009 | SDP-Based Algorithms for Maximum Independent Set Problems on Hypergraphs · ICALP (1) 2009 |
Graph algorithms and graph theory › independent set
maximum independent set |
0.1 | 1 | 2009 | SDP-Based Algorithms for Maximum Independent Set Problems on Hypergraphs · ICALP (1) 2009 |
Computational complexity
parameterized complexity |
0.1 | 1 | 2009 | Distortion Is Fixed Parameter Tractable · ICALP (1) 2009 |
Mathematical optimization › semidefinite programming
SDP rounding |
0.1 | 1 | 2009 | SDP-Based Algorithms for Maximum Independent Set Problems on Hypergraphs · ICALP (1) 2009 |
Mathematical optimization
semidefinite programming |
0.1 | 1 | 2009 | SDP-Based Algorithms for Maximum Independent Set Problems on Hypergraphs · ICALP (1) 2009 |
Algorithmic game theory and mechanism design
social choice |
0.1 | 1 | 2009 | Distortion Is Fixed Parameter Tractable · ICALP (1) 2009 |
Methods — techniques the papers use, named apart from their topics
semidefinite programming · 0.1parameterized complexity · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2016 | Streaming Algorithms for Independent Sets in Sparse Hypergraphs
Bjarni V. Halldórsson, Magnús M. Halldórsson, Elena Losievskaja, Mario Szegedy |
Algorithmica | 3 |
| 2013 | SDP-based algorithms for maximum independent set problems on hypergraphs
Geir Agnarsson, Magnús M. Halldórsson, Elena Losievskaja |
Theor. Comput. Sci. | 3 |
| 2010 | Streaming Algorithms for Independent Sets
Bjarni V. Halldórsson, Magnús M. Halldórsson, Elena Losievskaja, Mario Szegedy |
ICALP (1) | 3 |
| 2009 | SDP-Based Algorithms for Maximum Independent Set Problems on Hypergraphs
Geir Agnarsson, Magnús M. Halldórsson, Elena Losievskaja |
ICALP (1) | 3 |
| 2009 | Distortion Is Fixed Parameter Tractable
Michael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Elena Losievskaja, Frances A. Rosamond, Saket Saurabh 0001 |
ICALP (1) | 4 |
| 2009 | Independent sets in bounded-degree hypergraphs
Magnús M. Halldórsson, Elena Losievskaja |
Discret. Appl. Math. | 2 |
| 2007 | Independent Sets in Bounded-Degree Hypergraphs
Magnús M. Halldórsson, Elena Losievskaja |
WADS | 2 |