| Publication | Date of Publication | Type |
|---|
Uncovering patterns of technology use in consumer health informatics
Wiley Interdisciplinary Reviews. WIREs Computational Statistics | 2024-09-19 | Paper |
| Tyshkevich's Graph Decomposition and the Distinguishing Numbers of Unigraphs | 2023-08-07 | Paper |
The multi-spreader crane scheduling problem: partitions and supersequences
Discrete Applied Mathematics | 2020-12-29 | Paper |
| Stable Matchings with Restricted Preferences: Structure and Complexity | 2020-08-19 | Paper |
Maximum locally stable matchings
Algorithms | 2019-03-26 | Paper |
On the stable matchings that can be reached when the agents go marching in one by one
SIAM Journal on Discrete Mathematics | 2016-11-11 | Paper |
Split graphs and Nordhaus-Gaddum graphs
Discrete Mathematics | 2016-06-20 | Paper |
Eccentricity, center and radius computations on the cover graphs of distributive lattices with applications to stable matchings
Discrete Applied Mathematics | 2016-04-07 | Paper |
From discrepancy to declustering: near-optimal multidimensional declustering strategies for range queries
Journal of the ACM | 2015-08-01 | Paper |
Beyond knights and knaves
Graph-Theoretic Concepts in Computer Science | 2013-12-06 | Paper |
A poset-based approach to embedding median graphs in hypercubes and lattices
Order | 2012-03-23 | Paper |
Planarization and acyclic colorings of subcubic claw-free graphs
Graph-Theoretic Concepts in Computer Science | 2011-12-16 | Paper |
Stable roommates matchings, mirror posets, median graphs, and the local/global median phenomenon in stable matchings
SIAM Journal on Discrete Mathematics | 2011-10-27 | Paper |
Center stable matchings and centers of cover graphs of distributive lattices
Automata, Languages and Programming | 2011-07-06 | Paper |
Weak sense of direction labelings and graph embeddings
Discrete Applied Mathematics | 2011-03-10 | Paper |
Understanding the generalized median stable matchings
Algorithmica | 2010-10-07 | Paper |
Hardness results on the man-exchange stable marriage problem with short preference lists
Information Processing Letters | 2010-01-29 | Paper |
On computing the distinguishing and distinguishing chromatic numbers of interval graphs and other results
Discrete Mathematics | 2009-12-15 | Paper |
On Computing the Distinguishing Numbers of Planar Graphs and Beyond: A Counting Approach
SIAM Journal on Discrete Mathematics | 2009-11-27 | Paper |
A unified approach to finding good stable matchings in the hospitals/residents setting
Theoretical Computer Science | 2008-06-24 | Paper |
The Generalized Median Stable Matchings: Finding Them Is Not That Easy
Lecture Notes in Computer Science | 2008-04-15 | Paper |
The test suite generation problem: optimal instances and their implications
Discrete Applied Mathematics | 2007-09-19 | Paper |
On computing the distinguishing numbers of trees and forests
The Electronic Journal of Combinatorics | 2006-02-09 | Paper |
On computing the distinguishing numbers of trees and forests
The Electronic Journal of Combinatorics | 2006-02-09 | Paper |
Improved Approximation Algorithms for the Demand Routing and Slotting Problem with Unit Demands on Rings
SIAM Journal on Discrete Mathematics | 2005-02-28 | Paper |
| scientific article; zbMATH DE number 1472093 (Why is no real title available?) | 2000-07-09 | Paper |
