52 citations · 52 across the 3 of their papers we have counts for
3 papers
cs.DS2017
A 2-Approximation for the Height of Maximal Outerplanar Graph Drawings
Therese Biedl, Philippe Demontigny
In this paper, we study planar drawings of maximal outerplanar graphs with the objective of achieving small height. A recent paper gave an algorithm for such drawings that is withi…
math.NT2013★ 52 cited
Generalizing Zeckendorf's Theorem to f-decompositions
Philippe Demontigny, Thao Do, Archit Kulkarni +3
A beautiful theorem of Zeckendorf states that every positive integer can be uniquely decomposed as a sum of non-consecutive Fibonacci numbers , where , …
math.NT2013
A Generalization of Fibonacci Far-Difference Representations and Gaussian Behavior
Philippe Demontigny, Thao Do, Archit Kulkarni +2
A natural generalization of base B expansions is Zeckendorf's Theorem: every integer can be uniquely written as a sum of non-consecutive Fibonacci numbers , with $F_{n+1}…