Kitty Meeks

CoRR, 2024

2023

Edge Exploration of Temporal Graphs.

[BibT_eX]

[DOI]

Benjamin Merlin Bumpus

Algorithmica, March, 2023

Cops and Robbers on Multi-Layer Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2023

Counting Temporal Paths.

[BibT_eX]

[DOI]

Hendrik Molter

Proceedings of the 40th International Symposium on Theoretical Aspects of Computer Science, 2023

Counting Subgraphs in Somewhere Dense Graphs.

[BibT_eX]

[DOI]

Proceedings of the 14th Innovations in Theoretical Computer Science Conference, 2023

2022

Approximately Counting and Sampling Small Witnesses Using a Colorful Decision Oracle.

[BibT_eX]

[DOI]

Holger Dell

John Lapinskas

SIAM J. Comput., 2022

Reconstructing the degree sequence of a sparse graph from a partial deck.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 2022

Efficiently enumerating hitting sets of hypergraphs arising in data profiling.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2022

Nearly optimal independence oracle algorithms for edge estimation in hypergraphs.

[BibT_eX]

[DOI]

Holger Dell

John Lapinskas

CoRR, 2022

Brief Announcement: The Temporal Firefighter Problem.

[BibT_eX]

[DOI]

Samuel D. Hand

Proceedings of the 1st Symposium on Algorithmic Foundations of Dynamic Networks, 2022

A New Temporal Interpretation of Cluster Editing.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 33rd International Workshop, 2022

Making Life More Confusing for Firefighters.

[BibT_eX]

[DOI]

Samuel D. Hand

Proceedings of the 11th International Conference on Fun with Algorithms, 2022

Reducing Reachability in Temporal Graphs: Towards a More Realistic Model of Real-World Spreading Processes.

[BibT_eX]

[DOI]

Proceedings of the Revolutions and Revelations in Computability, 2022

2021

Improved inference for areal unit count data using graph-based optimisation.

[BibT_eX]

[DOI]

Duncan Lee

William Pettersson

Stat. Comput., 2021

Assigning times to minimise reachability in temporal graphs.

[BibT_eX]

[DOI]

Fiona Skerman

J. Comput. Syst. Sci., 2021

Deleting edges to restrict the size of an epidemic in temporal networks.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2021

Temporal Graphs: Structure, Algorithms, Applications (Dagstuhl Seminar 21171).

[BibT_eX]

[DOI]

Dagstuhl Reports, 2021

Tangled Paths: A Random Graph Model from Mallows Permutations.

[BibT_eX]

[DOI]

CoRR, 2021

The Complexity of Finding Optimal Subgraphs to Represent Spatial Correlation.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2021

2020

Solving hard stable matching problems involving groups of similar agents.

[BibT_eX]

[DOI]

Baharak Rastegari

Theor. Comput. Sci., 2020

On the complexity of optimally modifying graphs representing spatial correlation in areal unit count data.

[BibT_eX]

[DOI]

Duncan Lee

CoRR, 2020

Directed branch-width: A directed analogue of tree-width.

[BibT_eX]

[DOI]

Benjamin Merlin Bumpus

William Pettersson

CoRR, 2020

The Parameterised Complexity of Computing the Maximum Modularity of a Graph.

[BibT_eX]

[DOI]

Fiona Skerman

Algorithmica, 2020

Approximately counting and sampling small witnesses using a colourful decision oracle.

[BibT_eX]

[DOI]

Holger Dell

John Lapinskas

Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

2019

Extremal properties of flood-filling games.

[BibT_eX]

[DOI]

Dominik K. Vu

Discret. Math. Theor. Comput. Sci., 2019

Randomised Enumeration of Small Witnesses Using a Decision Oracle.

[BibT_eX]

[DOI]

Algorithmica, 2019

2018

On the complexity of finding and counting solution-free sets of integers.

[BibT_eX]

[DOI]

Andrew Treglown

Discret. Appl. Math., 2018

On the Enumeration of Minimal Hitting Sets in Lexicographical Order.

[BibT_eX]

[DOI]

CoRR, 2018

Changing times to optimise reachability in temporal graphs.

[BibT_eX]

[DOI]

CoRR, 2018

Deleting Edges to Restrict the Size of an Epidemic: A New Application for Treewidth.

[BibT_eX]

[DOI]

Algorithmica, 2018

Stable Marriage with Groups of Similar Agents.

[BibT_eX]

[DOI]

Baharak Rastegari

Proceedings of the Web and Internet Economics - 14th International Conference, 2018

2017

The Interactive Sum Choice Number of Graphs.

[BibT_eX]

[DOI]

Marthe Bonamy

Electron. Notes Discret. Math., 2017

Counting small subgraphs in multi-layer networks.

[BibT_eX]

[DOI]

CoRR, 2017

The parameterised complexity of counting even and odd induced subgraphs.

[BibT_eX]

[DOI]

Comb., 2017

Preface.

[BibT_eX]

[DOI]

Proceedings of the Surveys in Combinatorics, 2017

2016

The parameterised complexity of list problems on graphs of bounded treewidth.

[BibT_eX]

[DOI]

Inf. Comput., 2016

The challenges of unbounded treewidth in parameterised subgraph counting problems.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2016

2015

Some Hard Families of Parameterized Counting Problems.

[BibT_eX]

[DOI]

ACM Trans. Comput. Theory, 2015

The parameterised complexity of counting connected subgraphs and graph motifs.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2015

Deleting edges to restrict the size of an epidemic.

[BibT_eX]

[DOI]

CoRR, 2015

2014

Spanning Trees and the Complexity of Flood-Filling Games.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2014

2013

The complexity of Free-Flood-It on 2×n boards.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

Some hard classes of parameterised counting problems.

[BibT_eX]

[DOI]

CoRR, 2013

The Parameterised Complexity of Counting Connected Subgraphs.

[BibT_eX]

[DOI]

CoRR, 2013

2012

Graph colourings and games.

[BibT_eX]

[DOI]

PhD thesis, 2012

The complexity of flood-filling games on graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2012

2011

The complexity of Free-Flood-It on 2xn boards

[BibT_eX]

[DOI]