1 citations · 2 across the 2 of their papers we have counts for
Showing 2012Show all
2 papers · 1 filter
cs.DB2012★ 1 cited
On optimum left-to-right strategies for active context-free games
Henrik Björklund, Martin Schuster, Thomas Schwentick +1
Active context-free games are two-player games on strings over finite alphabets with one player trying to rewrite the input string to match a target specification. These games have…
cs.DS2012★ 1 cited
A New Upper Bound for the Traveling Salesman Problem in Cubic Graphs
Maciej Liskiewicz, Martin R. Schuster
We provide a new upper bound for traveling salesman problem (TSP) in cubic graphs, i.e. graphs with maximum vertex degree three, and prove that the problem for an -vertex graph…