
SeriesParallel Automata and Short Regular Expressions
– Nelma Moreira , Rogério Reis
 2009

14

Optimal reduction of twoterminal directed acyclic graphs
– Wolfgang W. Bein, Jerzy Kamburowski, Matthias F, M. Stallmann
 1992

5

Space Efficient Algorithms for SeriesParallel Graphs
– Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk
 2001

2

Minimum Convex Piecewise Linear Cost Tension Problem on Quasik SeriesParallel Graphs
– Bruno Bachelet, Philippe Mahey
 2003

4

Minimum ConvexCost Tension Problems on SeriesParallel Graphs
– Bruno Bachelet, Philippe Mahey
 2003

3

Space efficient algorithms for directed seriesparallel graphs
– Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk
 2002

27

The Steiner tree polytope and related polyhedra
– Michel X. Goemans
 1994

49

Efficient detection of determinacy races in Cilk programs
– Mingdong Feng
 1997

6

Parallel Algorithms for Series Parallel Graphs
– Hans L. Bodlaender, Babette De Fluiter
 1996

2

Solving Problems on Recursively Constructed Graphs
– Richard B. Borie, R. Gary Parker, Craig A. Tovey

7

RealTime Minimum Vertex Cover For TwoTerminal SeriesParallel Graphs
– Marius Nagy, Selim G. Akl
 2000


Logic and boundedwidth rational languages of posets over countable scattered linear orderings
– Nicolas Bedon


Logic and branching automata
– Nicolas Bedon

31

Algorithms To Schedule Tasks With And/or Precedence Constraints
– Donald William Gillies
 1993

1

An Efficient Parallel Algorithm for MinCost Flow on Directed SeriesParallel Networks
– Amit Jain, N. Chandrasekharan
 1993


Querying DAGshaped Execution Traces Through Views
– Maya Benari, Tova Milo, Elad Verbin


Lower Bounds on the Area Requirements of SeriesParallel Graphs
– Fabrizio Frati
 2009


Aggregation Approach for the Minimum Binary Cost Tension Problem
– Bruno Bachelet
 2005


By Maya BenAri
– Prepared Prof, Tova Milo
