Iain A. Stewart

CoRR, 2024

2023

Payment Scheduling in the Interval Debt Model.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2023: Theory and Practice of Computer Science, 2023

2020

Relating the bisection width of dual-port, server-centric datacenter networks and the solution of edge isoperimetric problems in graphs.

[BibT_eX]

[DOI]

Alejandro Erickson

Javier Navaridas

J. Comput. Syst. Sci., 2020

Variational networks of cube-connected cycles are recursive cubes of rings.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2020

Using semidirect products of groups to build classes of interconnection networks.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2020

2019

INRFlow: An interconnection networks research flow-level simulation framework.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 2019

2018

The influence of datacenter usage on symmetry in datacenter network design.

[BibT_eX]

[DOI]

Alejandro Erickson

J. Supercomput., 2018

2017

An Optimal Single-Path Routing Algorithm in the Datacenter Network DPillar.

[BibT_eX]

[DOI]

IEEE Trans. Parallel Distributed Syst., 2017

Sufficient conditions for Hamiltonicity in multiswapped networks.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 2017

On the combinatorial design of data centre network topologies.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2017

Improved routing algorithms in the dual-port datacenter networks HCN and BCN.

[BibT_eX]

[DOI]

Future Gener. Comput. Syst., 2017

Graph editing to a fixed target.

[BibT_eX]

[DOI]

Petr A. Golovach

Daniël Paulusma

Discret. Appl. Math., 2017

The stellar transformation: From interconnection networks to datacenter networks.

[BibT_eX]

[DOI]

Comput. Networks, 2017

2016

Edge-pancyclicity and edge-bipancyclicity of faulty folded hypercubes.

[BibT_eX]

[DOI]

Che-Nan Kuo

Theor. Comput. Sci., 2016

2015

Star-Replaced Networks: A Generalised Class of Dual-Port Server-Centric Data Centre Networks.

[BibT_eX]

[DOI]

CoRR, 2015

An efficient shortest-path routing algorithm in the data centre network {DP}illar.

[BibT_eX]

[DOI]

CoRR, 2015

Routing Algorithms for Recursively-Defined Data Centre Networks.

[BibT_eX]

[DOI]

Proceedings of the 2015 IEEE TrustCom/BigDataSE/ISPA, 2015

On Routing Algorithms for the DPillar Data Centre Networks.

[BibT_eX]

[DOI]

Abbas Eslami Kiasari

Javier Navaridas

Proceedings of the Algorithms and Architectures for Parallel Processing, 2015

On the Mathematics of Data Centre Network Topologies.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory - 20th International Symposium, 2015

An Efficient Shortest-Path Routing Algorithm in the Data Centre Network DPillar.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2015

2014

Interconnection Networks of Degree Three Obtained by Pruning Two-Dimensional Tori.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 2014

Improved Routing in the Data Centre Networks HCN and BCN.

[BibT_eX]

[DOI]

Proceedings of the Second International Symposium on Computing and Networking, 2014

Accelerating ant colony optimization-based edge detection on the GPU using CUDA.

[BibT_eX]

[DOI]

Laurence Dawson

Proceedings of the IEEE Congress on Evolutionary Computation, 2014

2013

Multiswapped networks and their topological and algorithmic properties.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2013

The expressibility of fragments of Hybrid Graph Logic on finite digraphs.

[BibT_eX]

[DOI]

James Gate

J. Appl. Log., 2013

Candidate Set Parallelization Strategies for Ant Colony Optimization on the GPU.

[BibT_eX]

[DOI]

Laurence Dawson

Proceedings of the Algorithms and Architectures for Parallel Processing, 2013

Improving Ant Colony Optimization performance on the GPU using CUDA.

[BibT_eX]

[DOI]

Laurence Dawson

Proceedings of the IEEE Congress on Evolutionary Computation, 2013

2012

A general technique to establish the asymptotic conditional diagnosability of interconnection networks.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

On the Computational Complexity of Routing in Faulty k-ary n-Cubes and Hypercubes.

[BibT_eX]

[DOI]

Parallel Process. Lett., 2012

Editorial.

[BibT_eX]

[DOI]

Daniël Paulusma

Matthew Johnson

J. Discrete Algorithms, 2012

2011

Bipancyclicity in k-Ary n-Cubes with Faulty Edges under a Conditional Fault Assumption.

[BibT_eX]

[DOI]

IEEE Trans. Parallel Distributed Syst., 2011

Augmented k-ary n-cubes.

[BibT_eX]

[DOI]

Inf. Sci., 2011

A Multipath Analysis of Biswapped Networks.

[BibT_eX]

[DOI]

Comput. J., 2011

Node-to-Node Disjoint Paths in k-ary n-cubes with Faulty Edges.

[BibT_eX]

[DOI]

Proceedings of the 17th IEEE International Conference on Parallel and Distributed Systems, 2011

Hamiltonian Cycles through Prescribed Edges in k-Ary n-Cubes.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2011

2010

A class of hierarchical graphs as topologies for interconnection networks.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2010

One-to-many node-disjoint paths in (n, k)-star graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2010

A general algorithm for detecting faults under the comparison diagnosis model.

[BibT_eX]

[DOI]

Proceedings of the 24th IEEE International Symposium on Parallel and Distributed Processing, 2010

Frameworks for Logically Classifying Polynomial-Time Optimisation Problems.

[BibT_eX]

[DOI]

James Gate

Proceedings of the Computer Science, 2010

2009

Bipanconnectivity and Bipancyclicity in k-ary n-cubes.

[BibT_eX]

[DOI]

IEEE Trans. Parallel Distributed Syst., 2009

Logical and Complexity-theoretic Aspects of Models of Computation with Restricted Access to Arrays.

[BibT_eX]

[DOI]

J. Log. Comput., 2009

Program Schemes, Queues, the Recursive Spectrum and Zero-one Laws.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2009

On the power of deep pushdown stacks.

[BibT_eX]

[DOI]

Acta Informatica, 2009

Pancyclicity and Panconnectivity in Augmented k-ary n-cubes.

[BibT_eX]

[DOI]

Proceedings of the 15th IEEE International Conference on Parallel and Distributed Systems, 2009

2008

Embedding Long Paths in k-Ary n-Cubes with Faulty Nodes and Links.

[BibT_eX]

[DOI]

IEEE Trans. Parallel Distributed Syst., 2008

The computational complexity of the parallel knock-out problem.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2008

On the fixed-parameter tractability of parameterized model-checking problems.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2008

Improved upper and lower bounds on the feedback vertex numbers of grids and butterflies.

[BibT_eX]

[DOI]

Discret. Math., 2008

Program Schemes with Deep Pushdown Storage.

[BibT_eX]

[DOI]

Argimiro Arratia

Proceedings of the Logic and Theory of Algorithms, 2008

2007

Constraint Satisfaction, Logic and Forbidden Patterns.

[BibT_eX]

[DOI]

SIAM J. Comput., 2007

Distributed Algorithms for Building Hamiltonian Cycles in k-Ary n-Cubes and Hypercubes with Faulty Links.

[BibT_eX]

[DOI]

J. Interconnect. Networks, 2007

2006

An Infinite Hierarchy in a Class of Polynomial-Time Program Schemes.

[BibT_eX]

[DOI]

Richard Gault

Theory Comput. Syst., 2006

2004

Dichotomies for classes of homomorphism problems involving unary functions.

[BibT_eX]

[DOI]

Tomás Feder

Theor. Comput. Sci., 2004

2003

Greedy algorithms, H-colourings and a complexity-theoretic dichotomy.

[BibT_eX]

[DOI]

Antonio Puricella

Theor. Comput. Sci., 2003

A note on first-order projections and games.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

Using Program Schemes to Capture Polynomial-Time Logically on Certain Classes of Structures.

[BibT_eX]

[DOI]

LMS J. Comput. Math., 2003

Some problems not definable using structure homomorphisms.

[BibT_eX]

Ars Comb., 2003

The complexity of achievement and maintenance problems in agent-based systems.

[BibT_eX]

[DOI]

Artif. Intell., 2003

2002

Program schemes, arrays, Lindström quantifiers and zero-one laws.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2002

Fault-Tolerant Embeddings of Hamiltonian Circuits in k-ary n-Cubes.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2002

2001

On a hierarchy involving transitive closure logic and existential second-order quantification.

[BibT_eX]

[DOI]

Richard Gault

Log. J. IGPL, 2001

Program schemes with binary write-once arrays and the complexity classes they capture

[BibT_eX]

[DOI]

CoRR, 2001

A Generic Greedy Algorithm, Partially-Ordered Graphs and NP-Completeness.

[BibT_eX]

[DOI]

Antonio Puricella

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

1999

Hierarchies in Classes of Program Schemes.

[BibT_eX]

[DOI]

S. R. Chauhan

J. Log. Comput., 1999

On the Power of Built-In Relations in Certain Classes of Program Schemes.

[BibT_eX]

[DOI]

S. R. Chauhan

Inf. Process. Lett., 1999

1998

Positive Versions of Polynomial Time.

[BibT_eX]

[DOI]

Clemens Lautemann

Thomas Schwentick

Inf. Comput., 1998

1997

On Embedding Cycles in k-Ary n-Cubes.

[BibT_eX]

[DOI]

Parallel Process. Lett., 1997

Logics with Zero-One Laws that Are Not Fragments of Bounded-Variable Infinitary Logic.

[BibT_eX]

[DOI]

Math. Log. Q., 1997

Regular Subgraphs in Graphs and Rooted Graphs and Definability in Monadic Second-Order Logic.

[BibT_eX]

[DOI]

Math. Log. Q., 1997

Communication Algorithms in k-Ary n-Cube Interconnection Networks.

[BibT_eX]

[DOI]

Aqeel Ahmed

Inf. Process. Lett., 1997

Generalized Hex and Logical Characterizations of Polynomial Space.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1997

On locating cubic subgraphs in bounded-degree connected bipartite graphs.

[BibT_eX]

[DOI]

Discret. Math., 1997

Embeddings of cycles, meshes and tori in faulty k-ary n-cubes.

[BibT_eX]

[DOI]

Proceedings of the 1997 International Conference on Parallel and Distributed Systems (ICPADS '97), 1997

A Perspective on Lindström Quantifiers and Oracles.

[BibT_eX]

[DOI]

Proceedings of the Generalized Quantifiers and Computation, 1997

1996

Finding Regular Subgraphs in Both Arbitrary and Planar Graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1996

On Positive P.

[BibT_eX]

[DOI]

Clemens Lautemann

Thomas Schwentick

Proceedings of the Eleveth Annual IEEE Conference on Computational Complexity, 1996

1995

Completeness of Path-Problems via Logical Reductions

[BibT_eX]

[DOI]

Inf. Comput., August, 1995

Complete Problems for Monotone NP.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1995

Reachability in Some Classes of Acyclic Petri Nets.

[BibT_eX]

[DOI]

Fundam. Informaticae, 1995

On the Intersections of Longest Cycles in a Graph.

[BibT_eX]

[DOI]

Ben Thompson

Exp. Math., 1995

1994

On Completeness for NP via Projection Translations.

[BibT_eX]

[DOI]

Math. Syst. Theory, 1994

Monotonicity and the Expressibility of NP Operators.

[BibT_eX]

[DOI]

Math. Log. Q., 1994

Logical Description of Monotone NP Problems.

[BibT_eX]

[DOI]

J. Log. Comput., 1994

Deciding whether a planar graph has a cubic subgraph is NP-complete.

[BibT_eX]

[DOI]

Discret. Math., 1994

Context-Sensitive Transitive Closure Operators.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 1994

1993

Methods for Proving Completeness via Logical Reductions.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1993

On Two Approximation Algorithms for the Clique Problem.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 1993

A New Characterization of Unbreakable Graphs.

[BibT_eX]

[DOI]

Stephan Olariu

Int. J. Found. Comput. Sci., 1993

Logical Characterizations of Bounded Query Classes II: Polynomial-Time Oracle Machines.

[BibT_eX]

[DOI]

Fundam. Informaticae, 1993

Logical Characterizations of Bounded Query Classes I: Logspace Oracle Machines.

[BibT_eX]

[DOI]

Fundam. Informaticae, 1993

An Parallelizing a Greedy Heuristic for Finding Small Dominant Sets.

[BibT_eX]

[DOI]

BIT, 1993

Logical and Schematic Characterization of Complexity Classes.

[BibT_eX]

[DOI]

Acta Informatica, 1993

Incorporating Generalized Quantifiers and the Least Fixed Point Operator.

[BibT_eX]

[DOI]

Proceedings of the Computer Science Logic, 7th Workshop, 1993

1992

Using the Hamiltonian Path Operator to Capture NP.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1992

Refining known Results on the generalized Word Problem for Free Groups.

[BibT_eX]

[DOI]

Int. J. Algebra Comput., 1992

Logical Characterization of Bounded Query Classes II: Polynomial-Time Oracle Machines.

[BibT_eX]

[DOI]

Proceedings of the Computer Science Logic, 6th Workshop, 1992

1991

Complete Problems Involving Boolean Labelled Structures and Projection Transactions.

[BibT_eX]

[DOI]

J. Log. Comput., 1991

Comparing the Expressibility of Languages Formed using NP-Complete Operators.

[BibT_eX]

[DOI]

J. Log. Comput., 1991

Complete Problems for Symmetric Logspace Involving Free Groups.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1991

Obtaining Nielsen Reduced Sets in Free Groups.

[BibT_eX]

Bull. EATCS, 1991

Copmlete Problems for Logspace Involving Lexicographic First Paths in Graphs.

[BibT_eX]

[DOI]

Proceedings of the 17th International Workshop, 1991

Complete Problems Involving Boolean Labelled Structures and Projections Translations.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1991

1990

On The Graph Accessibility Problem for Directed Graphs of Bounded Degree.

[BibT_eX]

Bull. EATCS, 1990

Comparing the expressibility of two languages formed using NP-complete graph operators.

[BibT_eX]

[DOI]

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

1989

An Algorithm for Colouring Perfect Planar Graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1989

1988

Colouring Perfect Planar Graphs in Parallel.

[BibT_eX]

[DOI]