Theoretical Computer Science
- Approximation algorithms for maximum two-dimensional pattern matching, AriDesLin-TCS-01
- Dynamic and static algorithms for optimal placement of resources in a tree, AulParPer-TCS-96
- Approximating uniform triangular meshes in polygons, AurKatKoj-TCS-02
- On beta-skeleton as a subgraph of the minimum weight triangulation, CheXu-TCS-01
- Planar orientations with low out-degree and compaction of adjacency matrices, ChrEpp-TCS-91
- A uniform approach to semi-dynamic problems on digraphs, CicFriNan-TCS-98
- Frozen development in graph coloring, CulGen-TCS-01
- Reliable computations on a faulty EREW PRAM, DikPel-TCS-96
- On mixed connectivity certificates, EveItkRaj-TCS-98
- Decomposable multi-parameter matroid optimization problems, Fer-TCS-03
- Dynamic algorithms for shortest paths in planar graphs, FeuMar-TCS-93
- Complexity, appeal and challenges of combinatorial games, Fra-TCS-04
- Semi-dynamic breadth-first search in digraphs, FraFriGia-TCS-01
- Speeding up dynamic programming with applications to molecular biology, GalGia-TCS-89
- Dynamic programming with convexity, concavity and sparsity, GalPar-TCS-92
- Data structures for two-edge connectivity in planar graphs, HerRauSur-TCS-94
- A work-time optimal algorithm for computing all string covers, IliPar-TCS-96
- Min-max-boundary domain decomposition, KiwSpiTen-TCS-01
- Compact Location Problems, KruMarNol-TCS-97
- New methods for 3-SAT decision and worst-case analysis, Kul-TCS-99
- Generating well-shaped $d$-dimensional Delaunay meshes, Li-TCS-03
- Parallel computation of polynomial GCD and some related parallel computations over abstract fields, Pan-TCS-96
- Reset words for commutative and solvable automata, Rys-TCS-97
- Composition sequences for functions over a finite domain, Sal-TCS-03
- Three dimensional weak visibility: complexity and applications, WanZhu-TCS-00
