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.
EDBT 2026 Demo / reviewers in the wild / expert

Ivan J. Balaban

dblp:70/2115 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1995
—ORCID · none

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

Theory of computation · 1 · 1 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 geometry · 100%

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

TopicWeightPapersLastEvidence papers
Computational geometry › geometric intersection
segment intersection		 0.011995
An Optimal Algorithm for Finding Segments Intersections · SCG 1995

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

deterministic algorithm · 0.0
YearPublicationVenuePosition
1995 An Optimal Algorithm for Finding Segments Intersections
abstract
This paper deals with a new deterministic algorithm for finding intersecting pairs from a given set of N segments in the plane.The algorithm is asymptotically optimal and has time and space complexity O(AJ log N+ K) and 0( IV ) respectively, where K is the number of intersecting pairs.The algorithm may be used for finding intersections not only line segments but also curve segments.
Ivan J. Balaban
 SCG1