Conferences in DBLP
Sanjeev Arora Proving Integrality Gaps without Knowing the Linear Program. [Citation Graph (0, 0)][DBLP ] FCT, 2003, pp:1- [Conf ] Takao Asano An Improved Analysis of Goemans and Williamson's LP-Relaxation for MAX SAT. [Citation Graph (0, 0)][DBLP ] FCT, 2003, pp:2-14 [Conf ] Amin Coja-Oghlan , Andreas Goerdt , André Lanka , Frank Schädlich Certifying Unsatisfiability of Random 2k -SAT Formulas Using Approximation Techniques. [Citation Graph (0, 0)][DBLP ] FCT, 2003, pp:15-26 [Conf ] Miroslav Chlebík , Janka Chlebíková Inapproximability Results for Bounded Variants of Optimization Problems. [Citation Graph (0, 0)][DBLP ] FCT, 2003, pp:27-38 [Conf ] Eric Angel , Evripidis Bampis , Laurent Gourvès Approximating the Pareto Curve with Local Search for the Bicriteria TSP (1, 2) Problem. [Citation Graph (0, 0)][DBLP ] FCT, 2003, pp:39-48 [Conf ] Monaldo Mastrolilli Scheduling to Minimize Max Flow Time: Offline and Online Algorithms. [Citation Graph (0, 0)][DBLP ] FCT, 2003, pp:49-60 [Conf ] Hans L. Bodlaender , Andreas Brandstädt , Dieter Kratsch , Michaël Rao , Jeremy Spinrad Linear Time Algorithms for Some NP-Complete Problems on (P_{5} , Gem)-Free Graphs. [Citation Graph (0, 0)][DBLP ] FCT, 2003, pp:61-72 [Conf ] Fedor V. Fomin , Pinar Heggernes , Jan Arne Telle Graph Searching, Elimination Trees, and a Generalization of Bandwidth. [Citation Graph (0, 0)][DBLP ] FCT, 2003, pp:73-85 [Conf ] Joachim Gudmundsson Constructing Sparse t-Spanners with Small Separators. [Citation Graph (0, 0)][DBLP ] FCT, 2003, pp:86-97 [Conf ] Mark Cieliebak , Stephan Eidenbenz , Aris Pagourtzis Composing Equipotent Teams. [Citation Graph (0, 0)][DBLP ] FCT, 2003, pp:98-108 [Conf ] Ivan Damgård , Gudmund Skovbjerg Frandsen Efficient Algorithms for GCD and Cubic Residuosity in the Ring of Eisenstein Integers. [Citation Graph (0, 0)][DBLP ] FCT, 2003, pp:109-117 [Conf ] Ivan Damgård , Gudmund Skovbjerg Frandsen An Extended Quadratic Frobenius Primality Test with Average and Worst Case Error Estimates. [Citation Graph (0, 0)][DBLP ] FCT, 2003, pp:118-131 [Conf ] Marcin Kik Periodic Multisorting Comparator Networks. [Citation Graph (0, 0)][DBLP ] FCT, 2003, pp:132-143 [Conf ] Grzegorz Stachowiak Fast Periodic Correction Networks. [Citation Graph (0, 0)][DBLP ] FCT, 2003, pp:144-156 [Conf ] Christos H. Papadimitriou Games and Networks. [Citation Graph (0, 0)][DBLP ] FCT, 2003, pp:157- [Conf ] Jan Arpe , Andreas Jakoby , Maciej Liskiewicz One-Way Communication Complexity of Symmetric Boolean Functions. [Citation Graph (0, 0)][DBLP ] FCT, 2003, pp:158-170 [Conf ] Kristoffer Arnsfelt Hansen , Peter Bro Miltersen , V. Vinay Circuits on Cylinders. [Citation Graph (0, 0)][DBLP ] FCT, 2003, pp:171-182 [Conf ] Peter Damaschke Fast Perfect Phylogeny Haplotype Inference. [Citation Graph (0, 0)][DBLP ] FCT, 2003, pp:183-194 [Conf ] Jens Gramm , Jiong Guo , Rolf Niedermeier On Exact and Approximation Algorithms for Distinguishing Substring Selection. [Citation Graph (0, 0)][DBLP ] FCT, 2003, pp:195-209 [Conf ] Patricia A. Evans , Andrew D. Smith Complexity of Approximating Closest Substring Problems. [Citation Graph (0, 0)][DBLP ] FCT, 2003, pp:210-221 [Conf ] Binhai Zhu On Lawson's Oriented Walk in Random Delaunay Triangulations. [Citation Graph (0, 0)][DBLP ] FCT, 2003, pp:222-233 [Conf ] Mikael Hammar , Bengt J. Nilsson , Mia Persson Competitive Exploration of Rectilinear Polygons. [Citation Graph (0, 0)][DBLP ] FCT, 2003, pp:234-245 [Conf ] Lyudmil Aleksandrov , Anil Maheshwari , Jörg-Rüdiger Sack An Improved Approximation Algorithm for Computing Geometric Shortest Paths. [Citation Graph (0, 0)][DBLP ] FCT, 2003, pp:246-257 [Conf ] Zheng Sun , John H. Reif Adaptive and Compact Discretization for Weighted Region Optimal Path Finding. [Citation Graph (0, 0)][DBLP ] FCT, 2003, pp:258-270 [Conf ] John H. Reif , Zheng Sun On Boundaries of Highly Visible Spaces and Applications. [Citation Graph (0, 0)][DBLP ] FCT, 2003, pp:271-283 [Conf ] Gheorghe Paun Membrane Computing. [Citation Graph (0, 0)][DBLP ] FCT, 2003, pp:284-295 [Conf ] Farid M. Ablayev , Aida Gainutdinova Classical Simulation Complexity of Quantum Machines. [Citation Graph (0, 0)][DBLP ] FCT, 2003, pp:296-302 [Conf ] Luis Antunes , Lance Fortnow , N. V. Vinodchandran Using Depth to Capture Average-Case Complexity. [Citation Graph (0, 0)][DBLP ] FCT, 2003, pp:303-310 [Conf ] Richard J. Lipton , Anastasios Viglas Non-uniform Depth of Polynomial Time and Space Simulations. [Citation Graph (0, 0)][DBLP ] FCT, 2003, pp:311-320 [Conf ] Martin Kutrib Dimension- and Time-Hierarchies for Small Time Bounds. [Citation Graph (0, 0)][DBLP ] FCT, 2003, pp:321-332 [Conf ] Philippe Moser Baire's Categories on Small Complexity Classes. [Citation Graph (0, 0)][DBLP ] FCT, 2003, pp:333-342 [Conf ] Jean Berstel , Luc Boasson , Olivier Carton , Bruno Petazzoni , Jean-Eric Pin Operations Preserving Recognizable Languages. [Citation Graph (0, 0)][DBLP ] FCT, 2003, pp:343-354 [Conf ] Vesa Halava , Tero Harju , Hendrik Jan Hoogeboom , Michel Latteux Languages Defined by Generalized Equality Sets. [Citation Graph (0, 0)][DBLP ] FCT, 2003, pp:355-363 [Conf ] Michele Bugliesi , Ambra Ceccato , Sabina Rossi Context-Sensitive Equivalences for Non-interference Based Protocol Analysis. [Citation Graph (0, 0)][DBLP ] FCT, 2003, pp:364-375 [Conf ] Werner Kuich , Klaus W. Wagner On the Exponentiation of Languages. [Citation Graph (0, 0)][DBLP ] FCT, 2003, pp:376-386 [Conf ] Christian Pech Kleene's Theorem for Weighted Tree-Automata. [Citation Graph (0, 0)][DBLP ] FCT, 2003, pp:387-399 [Conf ] Till Tantau Weak Cardinality Theorems for First-Order Logic. [Citation Graph (0, 0)][DBLP ] FCT, 2003, pp:400-411 [Conf ] Wan Fokkink , Rob J. van Glabbeek , Paulien de Wind Compositionality of Hennessy-Milner Logic through Structural Operational Semantics. [Citation Graph (0, 0)][DBLP ] FCT, 2003, pp:412-422 [Conf ] Andrzej Szalas On a Logical Approach to Estimating Computational Complexity of Potentially Intractable Problems. [Citation Graph (0, 0)][DBLP ] FCT, 2003, pp:423-431 [Conf ]