Ram Nathaniel

Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.

? Tutorial for this page

Demo Data from SIGIR 2026 / reviewers in the wild / expert

dblp:84/897 · DBLP profile ↗

← Back

2ranked-venue papers

0as first author

0since 2021 · last 2001

—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 2

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

Combinatorics and discrete mathematics · 54% Graph algorithms and graph theory · 23% Approximation and online algorithms · 23%

Topics — the 5 heaviest of 5, each with the papers that count most for it

Topic	Papers	Last	Evidence papers
Approximation and online algorithms approximation algorithms	1	2001	Approximating coloring and maximum independent sets in 3-uniform hypergraphs · SODA 2001
Graph algorithms and graph theory graph coloring	1	2001	Coloring k-colorable graphs using smaller palettes · SODA 2001
Combinatorics and discrete mathematics › hypergraph hypergraph coloring	1	2001	Approximating coloring and maximum independent sets in 3-uniform hypergraphs · SODA 2001
Combinatorics and discrete mathematics › hypergraph hypergraph independent set	1	2001	Approximating coloring and maximum independent sets in 3-uniform hypergraphs · SODA 2001
Combinatorics and discrete mathematics hypergraph	1	2001	Approximating coloring and maximum independent sets in 3-uniform hypergraphs · SODA 2001

Methods — techniques the papers use, named apart from their topics

approximation algorithm · 0.0

Year	Publication	Venue	Position
2001	Coloring k-colorable graphs using smaller palettes Eran Halperin, Ram Nathaniel, Uri Zwick	SODA	2
2001	Approximating coloring and maximum independent sets in 3-uniform hypergraphs Michael Krivelevich, Ram Nathaniel, Benny Sudakov	SODA	2