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 VLDB 2026 / reviewers in the wild / expert

Art Kazmierczak

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

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

Systems, architecture and hardware · 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
Graph algorithms and graph theory · 64% Distributed computing theory · 36%

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

TopicWeightPapersLastEvidence papers
Distributed computing theory
distributed graph algorithms		 0.012000
An Optimal Distributed Ear Decomposition Algorithm with Applications to Biconnectivity and Outerplanarity Testing · IEEE Trans. Parallel Distributed Syst. 2000
Graph algorithms and graph theory › graph decomposition
ear decomposition		 0.012000
An Optimal Distributed Ear Decomposition Algorithm with Applications to Biconnectivity and Outerplanarity Testing · IEEE Trans. Parallel Distributed Syst. 2000
Graph algorithms and graph theory
graph decomposition		 0.012000
An Optimal Distributed Ear Decomposition Algorithm with Applications to Biconnectivity and Outerplanarity Testing · IEEE Trans. Parallel Distributed Syst. 2000
Distributed computing theory › distributed algorithms
distributed network algorithms		 0.012000
An Optimal Distributed Ear Decomposition Algorithm with Applications to Biconnectivity and Outerplanarity Testing · IEEE Trans. Parallel Distributed Syst. 2000
Graph algorithms and graph theory › planar graphs
planarity testing		 0.012000
An Optimal Distributed Ear Decomposition Algorithm with Applications to Biconnectivity and Outerplanarity Testing · IEEE Trans. Parallel Distributed Syst. 2000

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

asynchronous message passing · 0.0
YearPublicationVenuePosition
2000 An Optimal Distributed Ear Decomposition Algorithm with Applications to Biconnectivity and Outerplanarity Testing
abstract
We present an asynchronous distributed algorithm to determine an ear decomposition of an arbitrary, connected, bidirectional network containing n-nodes and m-links which uses O(m) messages and which can be completed in O(n) time. Using the ear decomposition, we obtain the following results for a distributed network: 1) The distributed ear decomposition algorithm can be used to test biconnectivity, determine biconnected components, find cutpoints and bridges using O(m) messages in O(n) time. 2) The distributed ear decomposition algorithm can be used to test if a biconnected network is outerplanar using O(n) messages in O(n) time, and if the network is outerplanar, the embedding is also given using the same message and time complexity.
Art Kazmierczak, Sridhar Radhakrishnan
 IEEE Trans. Parallel Distributed Syst.1