217 citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- University of FloridaUS21 papers
- Monash UniversityAU16 papers
- Commonwealth Scientific and Industrial Research OrganisationAU14 papers
- The University of MelbourneAU13 papers
- Centre National de la Recherche ScientifiqueFR11 papers
- UNSW SydneyAU10 papers
- Commissariat à l'Énergie Atomique et aux Énergies AlternativesFR9 papers
- Max Planck Institute for AstronomyDE9 papers
- Max Planck Institute for Radio AstronomyDE9 papers
- University of CanterburyNZ9 papers
- Cardiff UniversityGB8 papers
- Space Science InstituteUS8 papers
9 papers · 1 filter
The saturation spectrum for antichains of subsets
Jerrold R. Griggs, Thomas Kalinowski, Uwe Leck +2
Extending a classical theorem of Sperner, we characterize the integers such that there exists a maximal antichain of size in the Boolean lattice , that is, the power s…
Feasible bases for a polytope related to the Hamilton cycle problem
Thomas Kalinowski, Sogol Mohammadian
We study a certain polytope depending on a graph and a parameter which arises from embedding the Hamiltonian cycle problem in a discounted Markov decision process.…
Lower bounds for dilation, wirelength, and edge congestion of embedding graphs into hypercubes
R. Sundara Rajan, Thomas Kalinowski, Sandi Klavžar +2
Interconnection networks provide an effective mechanism for exchanging data between processors in a parallel computing system. One of the most efficient interconnection networks is…
Hamiltonian cycles and subsets of discounted occupational measures
Ali Eshragh, Jerzy A. Filar, Thomas Kalinowski +1
We study a certain polytope arising from embedding the Hamiltonian cycle problem in a discounted Markov decision process. The Hamiltonian cycle problem can be reduced to finding pa…
Zero forcing in iterated line digraphs
Daniela Ferrero, Thomas Kalinowski, Sudeep Stephen
Zero forcing is a propagation process on a graph, or digraph, defined in linear algebra to provide a bound for the minimum rank problem. Independently, zero forcing was introduced…
Minimum Weight Flat Antichains of Subsets
Jerrold R. Griggs, Sven Hartmann, Thomas Kalinowski +2
Building on classical theorems of Sperner and Kruskal-Katona, we investigate antichains in the Boolean lattice of all subsets of , where $\…
A lower bound on the zero forcing number
Randy Davila, Thomas Kalinowski, Sudeep Stephen
In this note, we study a dynamic vertex coloring for a graph . In particular, one starts with a certain set of vertices black, and all other vertices white. Then, at each time s…
Minimum rank and zero forcing number for butterfly networks
Daniela Ferrero, Cyriac Grigorious, Thomas Kalinowski +2
The minimum rank of a simple graph is the smallest possible rank over all symmetric real matrices whose nonzero off-diagonal entries correspond to the edges of . Using t…
A Heuristic for Magic and Antimagic Graph Labellings
François Bertault, Mirka Miller, Hebert Pérez-Rosés +2
Graph labellings have been a very fruitful area of research in the last four decades. However, despite the staggering number of papers published in the field (over 1000), few gener…