23. WG 1997: Berlin, Germany
David P. Williamson
: Gadgets, Approximation, and Linear Programming: Improved Hardness Results for Cut and Satisfiability Problems (Abstract of Invited Lecture).
: Non-oblivious Local Search for MAX 2-CCSP with Application to MAX DICUT.
: Computing the Independence Number of Dense Triangle-Free Graphs.
: Minimal Elimination Ordering Inside a Given Chordal Graph.
Feodor F. Dragan
: On Greedy Matching Ordering and Greedy Matchable Graphs (Extended Abstract).
: Bicliques in Graphs II: Recognizing k-Path Graphs and Underlying Graphs of Line Digraphs.
: Structured Programs have Small Tree-Width and Good Register Allocation (Extended Abstract).
: A Measure of Parallelization for the Lexicographically First Maximal Subgraph Problems.