| Publication | Date of Publication | Type |
|---|
| On counting orientations for graph homomorphisms and for dually embedded graphs using the Tutte polynomial of matroid perspectives | 2026-02-10 | Paper |
Computing the fully optimal spanning tree of an ordered bipolar directed graph
Discrete Mathematics | 2024-03-27 | Paper |
| Short rewriting, and geometric explanations related to the active bijection, for: Extension-lifting bijections for oriented matroids, by S. Backman, F. Santos, C.H. Yuen, arXiv:1904.03562v2 (October 29, 2023) | 2023-12-12 | Paper |
The Tutte polynomial of matroid perspectives
Handbook of the Tutte Polynomial and Related Topics | 2023-04-28 | Paper |
The Tutte polynomial of oriented matroids
Handbook of the Tutte Polynomial and Related Topics | 2023-04-28 | Paper |
On Tutte polynomial expansion formulas in perspectives of matroids and oriented matroids
Discrete Mathematics | 2022-05-17 | Paper |
Complete graph drawings up to triangle mutations
Discrete & Computational Geometry | 2022-05-16 | Paper |
| Rectangles, integer vectors and hyperplanes of the hypercube | 2020-09-29 | Paper |
The active bijection for graphs
Advances in Applied Mathematics | 2019-03-18 | Paper |
The active bijection for graphs
Advances in Applied Mathematics | 2019-03-18 | Paper |
On the number of circuit-cocircuit reversal classes of an oriented matroid
Discrete Mathematics | 2019-02-20 | Paper |
| The Active Bijection 2.a - Decomposition of activities for matroid bases, and Tutte polynomial of a matroid in terms of beta invariants of minors | 2018-07-17 | Paper |
| The Active Bijection 2.b - Decomposition of activities for oriented matroids, and general definitions of the active bijection | 2018-07-17 | Paper |
| Orientations of Simplices Determined by Orderings on the Coordinates of their Vertices | 2016-02-04 | Paper |
Practical and efficient circle graph recognition
Algorithmica | 2014-11-19 | Paper |
Practical and efficient split decomposition via graph-labelled trees
Algorithmica | 2014-11-19 | Paper |
Computation with no memory, and rearrangeable multicast networks
(available as arXiv preprint) | 2014-05-02 | Paper |
| Computation with no memory, and rearrangeable multicast networks | 2014-05-02 | Paper |
A linear programming construction of fully optimal bases in graphs and hyperplane arrangements
Electronic Notes in Discrete Mathematics | 2013-10-10 | Paper |
Split decomposition and graph-labelled trees: characterizations and fully dynamic algorithms for totally decomposable graphs
Discrete Applied Mathematics | 2012-05-11 | Paper |
The active bijection between regions and simplices in supersolvable arrangements of hyperplanes
The Electronic Journal of Combinatorics | 2010-03-26 | Paper |
The active bijection between regions and simplices in supersolvable arrangements of hyperplanes
The Electronic Journal of Combinatorics | 2010-03-26 | Paper |
The active bijection in graphs, hyperplane arrangements, and oriented matroids, 1: the fully optimal basis of a bounded region
European Journal of Combinatorics | 2009-12-03 | Paper |
Mapping Computation with No Memory
Lecture Notes in Computer Science | 2009-10-22 | Paper |
Circuit-cocircuit reversing systems in regular matroids
Annals of Combinatorics | 2008-09-02 | Paper |
Fully Optimal Bases and the Active Bijection in Graphs, Hyperplane Arrangements, and Oriented Matroids
Electronic Notes in Discrete Mathematics | 2008-06-05 | Paper |
Dynamic Distance Hereditary Graphs Using Split Decomposition
Algorithms and Computation | 2008-05-27 | Paper |
Enumerating degree sequences in digraphs and a cycle--cocycle reversing system
European Journal of Combinatorics | 2007-04-10 | Paper |
On the evaluation at \((j,j^2)\) of the Tutte polynomial of a ternary matroid
Journal of Algebraic Combinatorics | 2007-01-05 | Paper |
Graph-Theoretic Concepts in Computer Science
Lecture Notes in Computer Science | 2006-11-01 | Paper |
Activity preserving bijections between spanning trees and orientations in graphs
Discrete Mathematics | 2005-09-22 | Paper |
Bases, reorientations, and linear programming, in uniform and rank-3 oriented matroids
Advances in Applied Mathematics | 2004-06-15 | Paper |
