6 citations · 7 across the 5 of their papers we have counts for
5 papers
Weight Balancing on Boundaries
Luis Barba, Otfried Cheong, Michael Gene Dobbins +8
Given a polygonal region containing a target point (which we assume is the origin), it is not hard to see that there are two points on the perimeter that are antipodal, that is, wh…
Order Preserving Matching
Jinil Kim, Peter Eades, Rudolf Fleischer +5
We introduce a new string matching problem called order-preserving matching on numeric strings where a pattern matches a text if the text contains a substring whose relative orders…
An Algorithmic Analysis of the Honey-Bee Game
Rudolf Fleischer, Gerhard J. Woeginger
The Honey-Bee game is a two-player board game that is played on a connected hexagonal colored grid or (in a generalized setting) on a connected graph with colored nodes. In a singl…
Traveling Salesmen in the Presence of Competition
Sandor P. Fekete, Rudolf Fleischer, Aviezri Fraenkel +1
We propose the ``Competing Salesmen Problem'' (CSP), a 2-player competitive version of the classical Traveling Salesman Problem. This problem arises when considering two competing…
The Complexity of Clickomania
Therese C. Biedl, Erik D. Demaine, Martin L. Demaine +3
We study a popular puzzle game known variously as Clickomania and Same Game. Basically, a rectangular grid of blocks is initially colored with some number of colors, and the player…