David Richerby

67 papers A* 3A 6B 7C 1Journal 45Unranked 4

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Three Algorithms for Parallel Graph Summarization. Expert Syst. J. Knowl. Eng. Till Blume, Jannik Rau, David Richerby, Ansgar Scherp
2024	—	`conf`	Lifelong Graph Learning for Graph Summarization. WI/IAT Jonatan Frank, Marcel Hoffmann, Nicolas Lell, David Richerby, Ansgar Scherp
2024	J	`jnl`	Lifelong Graph Summarization with Neural Networks: 2012, 2022, and a Time Warp. CoRR Jonatan Frank, Marcel Hoffmann, Nicolas Lell, David Richerby, Ansgar Scherp
2024	—	`conf`	Multi-View Structural Graph Summaries. WI/IAT Jonatan Frank, Andor Diera, David Richerby, Ansgar Scherp
2024	J	`jnl`	Multi-View Structural Graph Summaries. CoRR Jonatan Frank, Andor Diera, David Richerby, Ansgar Scherp
2023	B	`conf`	Computing k-Bisimulations for Large Graphs: A Comparison and Efficiency Analysis. ICGT Jannik Rau, David Richerby, Ansgar Scherp
2023	J	`jnl`	Structural Summarization of Semantic Graphs Using Quotients. TGDK Ansgar Scherp, David Richerby, Till Blume, Michael Cochez, Jannik Rau
2022	B	`conf`	Graph Summarization as Vertex Classification Task using Graph Neural Networks vs. Bloom Filter. DSAA Maximilian Blasi, Manuel Freudenreich, Johannes Horvath, David Richerby, Ansgar Scherp
2022	J	`jnl`	Graph Summarization with Graph Neural Networks. CoRR Maximilian Blasi, Manuel Freudenreich, Johannes Horvath, David Richerby, Ansgar Scherp
2022	J	`jnl`	Single-Purpose Algorithms vs. a Generic Graph Summarizer for Computing k-Bisimulations on Large Graphs. CoRR Jannik Rau, David Richerby, Ansgar Scherp
2021	J	`jnl`	FLUID: A common model for semantic structural graph summaries based on equivalence relations. Theor. Comput. Sci. Till Blume, David Richerby, Ansgar Scherp
2021	J	`jnl`	Faster exponential-time algorithms for approximately counting independent sets. Theor. Comput. Sci. Leslie Ann Goldberg, John Lapinskas, David Richerby
2021	J	`jnl`	Time and Memory Efficient Algorithm for Structural Graph Summaries over Evolving Graphs. CoRR Till Blume, David Richerby, Ansgar Scherp
2020	J	`jnl`	Faster Exponential-time Algorithms for Approximately Counting Independent Sets. CoRR Leslie Ann Goldberg, John Lapinskas, David Richerby
2020	A	`conf`	Incremental and Parallel Computation of Structural Graph Summaries for Evolving Graphs. CIKM Till Blume, David Richerby, Ansgar Scherp
2020	J	`jnl`	Phase transitions of the Moran process and algorithmic consequences. Random Struct. Algorithms Leslie Ann Goldberg, John Lapinskas, David Richerby
2018	J	`jnl`	Phase Transitions of the Moran Process and Algorithmic Consequences. CoRR Leslie Ann Goldberg, John Lapinskas, David Richerby
2017	J	`jnl`	Amplifiers for the Moran Process. J. ACM Andreas Galanis, Andreas Göbel, Leslie Ann Goldberg, John Lapinskas, David Richerby
2017	J	`jnl`	Functional clones and expressibility of partition functions. Theor. Comput. Sci. Andrei Bulatov, Leslie Ann Goldberg, Mark Jerrum, David Richerby, Stanislav Zivný
2016	J	`jnl`	Absorption time of the Moran process. Random Struct. Algorithms Josep Díaz, Leslie Ann Goldberg, David Richerby, Maria J. Serna
2016	A*	`conf`	Amplifiers for the Moran Process. ICALP Andreas Galanis, Andreas Göbel, Leslie Ann Goldberg, John Lapinskas, David Richerby
2016	J	`jnl`	Counting 4×4 matrix partitions of graphs. Discret. Appl. Math. Martin E. Dyer, Leslie Ann Goldberg, David Richerby
2016	J	`jnl`	Counting Homomorphisms to Square-Free Graphs, Modulo 2. ACM Trans. Comput. Theory Andreas Göbel, Leslie Ann Goldberg, David Richerby
2016	J	`jnl`	Functional Clones and Expressibility of Partition Functions. CoRR Andrei A. Bulatov, Leslie Ann Goldberg, Mark Jerrum, David Richerby, Stanislav Zivný
2015	J	`jnl`	Amplifiers for the Moran Process. CoRR Andreas Galanis, Andreas Göbel, Leslie Ann Goldberg, John Lapinskas, David Richerby
2015	—	`conf`	Counting Homomorphisms to Square-Free Graphs, Modulo 2. ICALP (1) Andreas Göbel, Leslie Ann Goldberg, David Richerby
2015	J	`jnl`	Counting Homomorphisms to Square-Free Graphs, Modulo 2. CoRR Andreas Göbel, Leslie Ann Goldberg, David Richerby
2015	J	`jnl`	Counting List Matrix Partitions of Graphs. SIAM J. Comput. Andreas Göbel, Leslie Ann Goldberg, Colin McQuillan, David Richerby, Tomoyuki Yamakami
2015	J	`jnl`	The complexity of approximating conservative counting CSPs. J. Comput. Syst. Sci. Xi Chen, Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum, Pinyan Lu, Colin McQuillan, David Richerby
2014	—	`conf`	Absorption Time of the Moran Process. APPROX-RANDOM Josep Díaz, Leslie Ann Goldberg, David Richerby, Maria J. Serna
2014	J	`jnl`	Approximating Fixation Probabilities in the Generalized Moran Process. Algorithmica Josep Díaz, Leslie Ann Goldberg, George B. Mertzios, David Richerby, Maria J. Serna, Paul G. Spirakis
2014	J	`jnl`	Counting 4×4 Matrix Partitions of Graphs. CoRR Martin E. Dyer, Leslie Ann Goldberg, David Richerby
2014	A	`conf`	Counting Homomorphisms to Cactus Graphs Modulo 2. STACS Andreas Göbel, Leslie Ann Goldberg, David Richerby
2014	A	`conf`	Counting List Matrix Partitions of Graphs. CCC Andreas Göbel, Leslie Ann Goldberg, Colin McQuillan, David Richerby, Tomoyuki Yamakami
2014	J	`jnl`	The complexity of counting homomorphisms to cactus graphs modulo 2. ACM Trans. Comput. Theory Andreas Göbel, Leslie Ann Goldberg, David Richerby
2013	J	`jnl`	Absorption Time of the Moran Process. CoRR Josep Díaz, Leslie Ann Goldberg, David Richerby, Maria J. Serna
2013	J	`jnl`	An Effective Dichotomy for the Counting Constraint Satisfaction Problem. SIAM J. Comput. Martin E. Dyer, David Richerby
2013	J	`jnl`	Counting list matrix partitions of graphs. CoRR Andreas Göbel, Leslie Ann Goldberg, Colin McQuillan, David Richerby, Tomoyuki Yamakami
2013	J	`jnl`	The Complexity of Counting Homomorphisms to Cactus Graphs Modulo 2. CoRR Andreas Göbel, Leslie Ann Goldberg, David Richerby
2013	A	`conf`	The complexity of approximating conservative counting CSPs. STACS Xi Chen, Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum, Pinyan Lu, Colin McQuillan, David Richerby
2012	A*	`conf`	Approximating fixation probabilities in the generalized Moran process. SODA Josep Díaz, Leslie Ann Goldberg, George B. Mertzios, David Richerby, Maria J. Serna, Paul G. Spirakis
2012	J	`jnl`	Can Fixation be Guaranteed in the Generalized Moran Process? CoRR Josep Díaz, Leslie Ann Goldberg, George B. Mertzios, David Richerby, Maria J. Serna, Paul G. Spirakis
2012	J	`jnl`	The complexity of approximating bounded-degree Boolean #CSP. Inf. Comput. Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, David Richerby
2012	J	`jnl`	The complexity of approximating conservative counting CSPs CoRR Xi Chen, Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum, Pinyan Lu, Colin McQuillan, David Richerby
2012	J	`jnl`	The complexity of weighted and unweighted #CSP. J. Comput. Syst. Sci. Andrei A. Bulatov, Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, Mark Jerrum, David Richerby
2011	J	`jnl`	Approximating Fixation Probabilities in the Generalized Moran Process CoRR Josep Díaz, Leslie Ann Goldberg, George B. Mertzios, David Richerby, Maria J. Serna, Paul G. Spirakis
2011	J	`jnl`	Searching for a Visible, Lazy Fugitive. SIAM J. Discret. Math. David Richerby, Dimitrios M. Thilikos
2011	A	`conf`	The #CSP Dichotomy is Decidable. STACS Martin E. Dyer, David Richerby
2010	A*	`conf`	On the complexity of #CSP. STOC Martin E. Dyer, David Richerby
2010	J	`jnl`	The Complexity of #CSP CoRR Martin E. Dyer, David Richerby
2010	J	`jnl`	The Complexity of Approximating Bounded-Degree Boolean #CSP (Extended Abstract) CoRR Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, David Richerby
2010	A	`conf`	The Complexity of Approximating Bounded-Degree Boolean #CSP. STACS Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, David Richerby
2010	J	`jnl`	The complexity of weighted and unweighted #CSP CoRR Andrei A. Bulatov, Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, Mark Jerrum, David Richerby
2009	J	`jnl`	Graph Searching in a Crime Wave. SIAM J. Discret. Math. David Richerby, Dimitrios M. Thilikos
2009	J	`jnl`	Interval bigraphs are unit grid intersection graphs. Discret. Math. David Richerby
2009	J	`jnl`	The Complexity of Approximating Bounded-Degree Boolean #CSP CoRR Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, David Richerby
2009	J	`jnl`	The complexity of weighted Boolean #CSP with mixed signs. Theor. Comput. Sci. Andrei A. Bulatov, Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, David Richerby
2008	J	`jnl`	Choiceless polynomial time, counting and the Cai-Fürer-Immerman graphs. Ann. Pure Appl. Log. Anuj Dawar, David Richerby, Benjamin Rossman
2008	B	`conf`	Searching for a Visible, Lazy Fugitive. WG David Richerby, Dimitrios M. Thilikos
2008	J	`jnl`	The Complexity of Weighted Boolean #CSP with Mixed Signs CoRR Andrei A. Bulatov, Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, David Richerby
2007	B	`conf`	Graph Searching in a Crime Wave. WG David Richerby, Dimitrios M. Thilikos
2007	B	`conf`	The Power of Counting Logics on Restricted Classes of Finite Structures. CSL Anuj Dawar, David Richerby
2005	C	`conf`	Choiceless Polynomial Time, Counting and the Cai-Fürer-Immerman Graphs: (Extended Abstract). WoLLIC Anuj Dawar, David Richerby, Benjamin Rossman
2004	—	`—`	Fixed-point logics with choice. David Richerby
2004	B	`conf`	Logical Characterizations of PSPACE. CSL David Richerby
2003	B	`conf`	A Fixed-Point Logic with Symmetric Choice. CSL Anuj Dawar, David Richerby
2003	J	`jnl`	Fixed-point Logics with Nondeterministic Choice. J. Log. Comput. Anuj Dawar, David Richerby