David Richerby

Proceedings of the Graph Transformation - 16th International Conference, 2023

2022

Single-Purpose Algorithms vs. a Generic Graph Summarizer for Computing k-Bisimulations on Large Graphs.

[BibT_eX]

[DOI]

Jannik Rau

CoRR, 2022

Graph Summarization with Graph Neural Networks.

[BibT_eX]

[DOI]

CoRR, 2022

Graph Summarization as Vertex Classification Task using Graph Neural Networks vs. Bloom Filter.

[BibT_eX]

[DOI]

Proceedings of the 9th IEEE International Conference on Data Science and Advanced Analytics, 2022

2021

Faster exponential-time algorithms for approximately counting independent sets.

[BibT_eX]

[DOI]

John Lapinskas

Theor. Comput. Sci., 2021

FLUID: A common model for semantic structural graph summaries based on equivalence relations.

[BibT_eX]

[DOI]

Till Blume

Theor. Comput. Sci., 2021

Time and Memory Efficient Algorithm for Structural Graph Summaries over Evolving Graphs.

[BibT_eX]

[DOI]

Till Blume

CoRR, 2021

2020

Phase transitions of the Moran process and algorithmic consequences.

[BibT_eX]

[DOI]

John Lapinskas

Random Struct. Algorithms, 2020

Incremental and Parallel Computation of Structural Graph Summaries for Evolving Graphs.

[BibT_eX]

[DOI]

Till Blume

Proceedings of the CIKM '20: The 29th ACM International Conference on Information and Knowledge Management, 2020

2017

Functional clones and expressibility of partition functions.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2017

Amplifiers for the Moran Process.

[BibT_eX]

[DOI]

J. ACM, 2017

2016

Counting Homomorphisms to Square-Free Graphs, Modulo 2.

[BibT_eX]

[DOI]

Andreas Göbel

ACM Trans. Comput. Theory, 2016

Absorption time of the Moran process.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2016

Counting 4×4 matrix partitions of graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2016

2015

Counting List Matrix Partitions of Graphs.

[BibT_eX]

[DOI]

SIAM J. Comput., 2015

The complexity of approximating conservative counting CSPs.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2015

2014

The complexity of counting homomorphisms to cactus graphs modulo 2.

[BibT_eX]

[DOI]

Andreas Göbel

ACM Trans. Comput. Theory, 2014

Approximating Fixation Probabilities in the Generalized Moran Process.

[BibT_eX]

[DOI]

Algorithmica, 2014

Counting Homomorphisms to Cactus Graphs Modulo 2.

[BibT_eX]

[DOI]

Andreas Göbel

Proceedings of the 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), 2014

2013

An Effective Dichotomy for the Counting Constraint Satisfaction Problem.

[BibT_eX]

[DOI]

SIAM J. Comput., 2013

2012

The complexity of weighted and unweighted #CSP.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2012

The complexity of approximating bounded-degree Boolean #CSP.

[BibT_eX]

[DOI]

Inf. Comput., 2012

Can Fixation be Guaranteed in the Generalized Moran Process?

[BibT_eX]

[DOI]

CoRR, 2012

2011

Searching for a Visible, Lazy Fugitive.

[BibT_eX]

[DOI]

Dimitrios M. Thilikos

SIAM J. Discret. Math., 2011

The #CSP Dichotomy is Decidable.

[BibT_eX]

[DOI]

Proceedings of the 28th International Symposium on Theoretical Aspects of Computer Science, 2011

2010

The Complexity of Approximating Bounded-Degree Boolean #CSP (Extended Abstract)

[BibT_eX]

[DOI]

CoRR, 2010

On the complexity of #CSP.

[BibT_eX]

[DOI]

Proceedings of the 42nd ACM Symposium on Theory of Computing, 2010

2009

The complexity of weighted Boolean #CSP with mixed signs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

Graph Searching in a Crime Wave.

[BibT_eX]

[DOI]

Dimitrios M. Thilikos

SIAM J. Discret. Math., 2009

Interval bigraphs are unit grid intersection graphs.

[BibT_eX]

[DOI]

Discret. Math., 2009

2008

Choiceless polynomial time, counting and the Cai-Fürer-Immerman graphs.

[BibT_eX]

[DOI]

Benjamin Rossman

Ann. Pure Appl. Log., 2008

2007

The Power of Counting Logics on Restricted Classes of Finite Structures.

[BibT_eX]

[DOI]

Proceedings of the Computer Science Logic, 21st International Workshop, 2007

2005

Choiceless Polynomial Time, Counting and the Cai-Fürer-Immerman Graphs: (Extended Abstract).

[BibT_eX]

[DOI]

Benjamin Rossman

Proceedings of the 12th Workshop on Logic, Language, Information and Computation, 2005

2004

Fixed-point logics with choice.

[BibT_eX]

[DOI]

PhD thesis, 2004

Logical Characterizations of PSPACE.

[BibT_eX]

[DOI]

Proceedings of the Computer Science Logic, 18th International Workshop, 2004

2003

Fixed-point Logics with Nondeterministic Choice.

[BibT_eX]

[DOI]

J. Log. Comput., 2003

A Fixed-Point Logic with Symmetric Choice.

[BibT_eX]

[DOI]