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

Martin Marciniszyn

dblp:01/3076 · DBLP profile ↗
← Back
4ranked-venue papers
3as first author
0since 2021 · last 2007
—ORCID · none

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

Theory of computation · 3 · 3 first-authorArtificial intelligence and machine learning · 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
1 paper
Graph algorithms and graph theory · 67% Approximation and online algorithms · 33%
Artificial intelligence
1 paper
Reinforcement learning · 50% Graph learning · 50%

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

TopicWeightPapersLastEvidence papers
Machine learning › Reinforcement learning
observational learning
0.112007
Observational Learning in Random Networks · COLT 2007
Machine learning › Graph learning
random graphs
0.112007
Observational Learning in Random Networks · COLT 2007
Graph algorithms and graph theory
graph coloring
0.112007
Online vertex colorings of random graphs without monochromatic subgraphs · SODA 2007
Approximation and online algorithms › online algorithms › online graph algorithms
online graph coloring
0.112007
Online vertex colorings of random graphs without monochromatic subgraphs · SODA 2007
Graph algorithms and graph theory
random graphs
0.112007
Online vertex colorings of random graphs without monochromatic subgraphs · SODA 2007

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

probabilistic method · 0.1network analysis · 0.1
YearPublicationVenuePosition
2007 Observational Learning in Random Networks
Julian Lorenz, Martin Marciniszyn, Angelika Steger
COLT2
2007 Online vertex colorings of random graphs without monochromatic subgraphs
Martin Marciniszyn, Reto Spöhel
SODA1
2006 Threshold Functions for Asymmetric Ramsey Properties Involving Cliques
Martin Marciniszyn, Jozef Skokan, Reto Spöhel, Angelika Steger
APPROX-RANDOM1
2005 The Online Clique Avoidance Game on Random Graphs
Martin Marciniszyn, Reto Spöhel, Angelika Steger
APPROX-RANDOM1