| Publication | Date of Publication | Type |
|---|
Reconfigurable routing in data center networks
Theoretical Computer Science | 2025-04-07 | Paper |
Payment scheduling in the interval debt model
Theoretical Computer Science | 2025-01-16 | Paper |
Colouring perfect planar graphs in parallel
Graph-Theoretic Concepts in Computer Science | 2024-02-28 | Paper |
Payment scheduling in the interval debt model
Lecture Notes in Computer Science | 2023-08-14 | Paper |
Using semidirect products of groups to build classes of interconnection networks
Discrete Applied Mathematics | 2020-06-29 | Paper |
Variational networks of cube-connected cycles are recursive cubes of rings
Information Processing Letters | 2020-02-18 | Paper |
Relating the bisection width of dual-port, server-centric datacenter networks and the solution of edge isoperimetric problems in graphs
Journal of Computer and System Sciences | 2019-11-29 | Paper |
On the combinatorial design of data centre network topologies
Journal of Computer and System Sciences | 2017-09-07 | Paper |
Interconnection Networks of Degree Three Obtained by Pruning Two-Dimensional Tori
IEEE Transactions on Computers | 2017-06-20 | Paper |
Graph editing to a fixed target
Discrete Applied Mathematics | 2016-11-24 | Paper |
Communication algorithms in k-ary n-cube interconnection networks
Information Processing Letters | 2016-06-01 | Paper |
Generalized hex and logical characterizations of polynomial space
Information Processing Letters | 2016-05-26 | Paper |
Edge-pancyclicity and edge-bipancyclicity of faulty folded hypercubes
Theoretical Computer Science | 2016-04-01 | Paper |
An efficient shortest-path routing algorithm in the data centre network DPillar
Combinatorial Optimization and Applications | 2016-02-05 | Paper |
An efficient shortest-path routing algorithm in the data centre network DPillar
Combinatorial Optimization and Applications | 2016-02-05 | Paper |
On the mathematics of data centre network topologies
Fundamentals of Computation Theory | 2015-09-29 | Paper |
The expressibility of fragments of hybrid graph logic on finite digraphs
Journal of Applied Logic | 2014-04-17 | Paper |
Multiswapped networks and their topological and algorithmic properties
Journal of Computer and System Sciences | 2014-01-27 | Paper |
Graph editing to a fixed target
Lecture Notes in Computer Science | 2014-01-17 | Paper |
On the computational complexity of routing in faulty \(k\)-ary \(n\)-cubes and hypercubes
Parallel Processing Letters | 2012-12-12 | Paper |
A general technique to establish the asymptotic conditional diagnosability of interconnection networks
Theoretical Computer Science | 2012-10-11 | Paper |
Hamiltonian cycles through prescribed edges in \(k\)-ary \(n\)-cubes
Combinatorial Optimization and Applications | 2011-08-12 | Paper |
Augmented \(k\)-ary \(n\)-cubes
Information Sciences | 2011-01-28 | Paper |
A class of hierarchical graphs as topologies for interconnection networks
Theoretical Computer Science | 2010-07-07 | Paper |
Frameworks for logically classifying polynomial-time optimisation problems
Computer Science – Theory and Applications | 2010-06-22 | Paper |
One-to-many node-disjoint paths in \((n,k)\)-star graphs
Discrete Applied Mathematics | 2010-05-05 | Paper |
On the fixed-parameter tractability of parameterized model-checking problems
Information Processing Letters | 2010-04-19 | Paper |
On the power of deep pushdown stacks
Acta Informatica | 2009-11-16 | Paper |
Program Schemes, Queues, the Recursive Spectrum and Zero-one Laws
Fundamenta Informaticae | 2009-06-23 | Paper |
Logical and Complexity-theoretic Aspects of Models of Computation with Restricted Access to Arrays
Journal Of Logic And Computation | 2009-03-02 | Paper |
The Computational Complexity of the Parallel Knock-Out Problem
LATIN 2006: Theoretical Informatics | 2008-09-18 | Paper |
Improved upper and lower bounds on the feedback vertex numbers of grids and butterflies
Discrete Mathematics | 2008-09-04 | Paper |
Program Schemes with Deep Pushdown Storage
Logic and Theory of Algorithms | 2008-06-19 | Paper |
The computational complexity of the parallel knock-out problem
Theoretical Computer Science | 2008-04-15 | Paper |
Constraint Satisfaction, Logic and Forbidden Patterns
SIAM Journal on Computing | 2008-03-28 | Paper |
An infinite hierarchy in a class of polynomial-time program schemes
Theory of Computing Systems | 2006-10-16 | Paper |
The complexity of achievement and maintenance problems in agent-based systems
Artificial Intelligence | 2006-02-07 | Paper |
| scientific article; zbMATH DE number 2191987 (Why is no real title available?) | 2005-08-04 | Paper |
Using Program Schemes to Capture Polynomial-Time Logically on Certain Classes of Structures
LMS Journal of Computation and Mathematics | 2004-11-18 | Paper |
Dichotomies for classes of homomorphism problems involving unary functions
Theoretical Computer Science | 2004-10-27 | Paper |
| scientific article; zbMATH DE number 2044949 (Why is no real title available?) | 2004-02-18 | Paper |
Greedy algorithms, H-colourings and a complexity-theoretic dichotomy.
Theoretical Computer Science | 2003-08-17 | Paper |
A note on first-order projections and games.
Theoretical Computer Science | 2003-08-17 | Paper |
Fault-Tolerant Embeddings of Hamiltonian Circuits in <i>k</i>-ary <i>n</i>-Cubes
SIAM Journal on Discrete Mathematics | 2003-01-05 | Paper |
On a hierarchy involving transitive closure logic and existential second-order quantification
Logic Journal of the IGPL | 2002-10-21 | Paper |
| scientific article; zbMATH DE number 1796951 (Why is no real title available?) | 2002-09-05 | Paper |
Program schemes, arrays, Lindström quantifiers and zero-one laws
Theoretical Computer Science | 2002-07-31 | Paper |
| scientific article; zbMATH DE number 1678393 (Why is no real title available?) | 2001-12-04 | Paper |
| scientific article; zbMATH DE number 1555193 (Why is no real title available?) | 2001-01-22 | Paper |
| scientific article; zbMATH DE number 1453078 (Why is no real title available?) | 2000-05-25 | Paper |
| scientific article; zbMATH DE number 1424048 (Why is no real title available?) | 2000-03-23 | Paper |
Hierarchies in classes of program schemes
Journal Of Logic And Computation | 2000-03-16 | Paper |
| scientific article; zbMATH DE number 1283959 (Why is no real title available?) | 1999-06-20 | Paper |
| scientific article; zbMATH DE number 1300959 (Why is no real title available?) | 1999-06-16 | Paper |
On the power of built-in relations in certain classes of program schemes
Information Processing Letters | 1999-03-02 | Paper |
Logics with Zero-One Laws that Are Not Fragments of Bounded-Variable Infinitary Logic
Mathematical Logic Quarterly | 1997-11-05 | Paper |
On locating cubic subgraphs in bounded-degree connected bipartite graphs
Discrete Mathematics | 1997-06-09 | Paper |
Regular Subgraphs in Graphs and Rooted Graphs and Definability in Monadic Second - Order Logic
Mathematical Logic Quarterly | 1997-04-08 | Paper |
Complete problems for monotone NP
Theoretical Computer Science | 1997-02-28 | Paper |
Finding regular subgraphs in both arbitrary and planar graphs
Discrete Applied Mathematics | 1997-01-14 | Paper |
| scientific article; zbMATH DE number 910751 (Why is no real title available?) | 1996-12-05 | Paper |
On the Intersections of Longest Cycles in a Graph
Experimental Mathematics | 1996-07-14 | Paper |
On the Intersections of Longest Cycles in a Graph
Experimental Mathematics | 1996-07-14 | Paper |
On the Intersections of Longest Cycles in a Graph
Experimental Mathematics | 1996-07-14 | Paper |
Completeness of path-problems via logical reductions
Information and Computation | 1995-09-20 | Paper |
| scientific article; zbMATH DE number 762060 (Why is no real title available?) | 1995-06-08 | Paper |
Monotonicity and the Expressibility of NP Operators
Mathematical Logic Quarterly | 1995-06-07 | Paper |
Logical Description of Monotone NP Problems
Journal Of Logic And Computation | 1994-09-13 | Paper |
| scientific article; zbMATH DE number 515747 (Why is no real title available?) | 1994-06-13 | Paper |
Logical and schematic characterization of complexity classes
Acta Informatica | 1994-06-02 | Paper |
Context-sensitive transitive closure operators
Annals of Pure and Applied Logic | 1994-04-12 | Paper |
Deciding whether a planar graph has a cubic subgraph is NP-complete
Discrete Mathematics | 1994-04-04 | Paper |
A NEW CHARACTERIZATION OF UNBREAKABLE GRAPHS
International Journal of Foundations of Computer Science | 1994-03-27 | Paper |
ON TWO APPROXIMATION ALGORITHMS FOR THE CLIQUE PROBLEM
International Journal of Foundations of Computer Science | 1994-03-27 | Paper |
On completeness for NP via projection translations
Mathematical Systems Theory | 1994-03-24 | Paper |
Methods for proving completeness via logical reductions
Theoretical Computer Science | 1993-12-20 | Paper |
| scientific article; zbMATH DE number 408812 (Why is no real title available?) | 1993-09-06 | Paper |
On parallelizing a greedy heuristic for finding small dominant sets
BIT | 1993-08-30 | Paper |
| scientific article; zbMATH DE number 219246 (Why is no real title available?) | 1993-06-29 | Paper |
| scientific article; zbMATH DE number 223336 (Why is no real title available?) | 1993-06-29 | Paper |
| scientific article; zbMATH DE number 223337 (Why is no real title available?) | 1993-06-29 | Paper |
| scientific article; zbMATH DE number 139797 (Why is no real title available?) | 1993-03-28 | Paper |
| scientific article; zbMATH DE number 88947 (Why is no real title available?) | 1993-01-16 | Paper |
Using the Hamiltonian path operator to capture NP
Journal of Computer and System Sciences | 1993-01-16 | Paper |
Complete problems for symmetric logspace involving free groups
Information Processing Letters | 1992-06-28 | Paper |
Complete Problems Involving Boolean Labelled Structures and Projection Transactions
Journal Of Logic And Computation | 1992-06-28 | Paper |
| scientific article; zbMATH DE number 8769 (Why is no real title available?) | 1992-06-25 | Paper |
REFINING KNOWN RESULTS ON THE GENERALIZED WORD PROBLEM FOR FREE GROUPS
International Journal of Algebra and Computation | 1992-06-25 | Paper |
Comparing the Expressibility of Languages Formed Using NP-Complete Operators
Journal Of Logic And Computation | 1991-01-01 | Paper |
An algorithm for colouring perfect planar graphs
Information Processing Letters | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4049083 (Why is no real title available?) | 1987-01-01 | Paper |
The paraheight of certain skew linear groups
Archiv der Mathematik | 1987-01-01 | Paper |
Supersolubility in Certain Skew Linear Groups
Journal of the London Mathematical Society | 1987-01-01 | Paper |
Hypercentrality and hypercyclicity in skew linear groups
Archiv der Mathematik | 1987-01-01 | Paper |
