|
|
| |
| Universität Bonn -> Institut für Informatik -> Abteilung V | ||
| CS-Reports 1997 |
Copyright 1997 Universität Bonn,
Institut für Informatik, Abteilung V
|
|
| 85164 |
An Approximation Algorithm for the Bandwidth Problem on Dense Graphs
Marek Karpinski, Juergen Wirtgen, Alex Zelikovsky [Download PostScript] [Download PDF] [Abstract] |
|
| 85165 |
Once again: Finding simple cycles in graphs
Carsten Dorgerloh, Juergen Wirtgen [Download PostScript] [Download PDF] [Abstract] |
|
| 85166 |
A New Measure of the Distance between Ordered Trees and its Applications
Thorsten Richter [Download PostScript] [Download PDF] [Abstract] |
|
| 85167 |
A New Algorithm for the Ordered Tree Inclusion Problem
Thorsten Richter [Download PostScript] [Download PDF] [Abstract] |
|
| 85168 |
On Primitive Cellular Algebras
Sergi Evdokimov, Ilia Ponomarenko [Download PostScript] [Download PDF] [Abstract] |
|
| 85169 |
Polynomial Time Algorithms for Modules over Finite Dimensional Algebras
Alexander Evdokimov, Marek Karpinski [Download PostScript] [Download PDF] [Abstract] |
|
| 85170 |
Approximate Counting of Given Length Cycles
Carsten Dorgerloh, Juergen Wirtgen [Download PostScript] [Download PDF] [Abstract] |
|
| 85171 |
Polynomial Time Approximability of Dense Weighted Instances of MAX-CUT
W. Fernandez de la Vega, Marek Karpinski [Download PostScript] [Download PDF] [Abstract] |
|
| 85172 |
Polynomial Time Approximation Schemes for Some Dense Instances of NP-Hard Optimization Problems
Marek Karpinski [Download PostScript] [Download PDF] [Abstract] |
|
| 85173 |
o-Minimal Expansions of the Real Field: A Characterization, and an Application to Pfaffian Closure
Marek Karpinski, Angus Macintyre [Download PostScript] [Download PDF] [Abstract] |
|
| 85174 |
Approximating Volumes and Integrals in o-Minimal and p-Minimal Theories
Marek Karpinski, Angus Macintyre [Download PostScript] [Download PDF] [Abstract] |
|
| 85175 |
Zero Testing of p-adic and Modular Polynomials
Marek Karpinski, Alf van der Poorten, Igor Shparlinski [Download PostScript] [Download PDF] [Abstract] |
|
| 85176 |
NP-Hardness of the Bandwidth Problem on Dense Graphs
Marek Karpinski, Juergen Wirtgen [Download PostScript] [Download PDF] [Abstract] |
|
| 85177 |
Some Tools for Modeling and Analysis of Surfaces
Carsten Dorgerloh, Jens Luessem, Morakot Pilouk, Juergen Wirtgen [Download PostScript] [Download PDF] [Abstract] |
|
| 85178 |
On Approximation Hardness of the Bandwidth Problem
Marek Karpinski, Juergen Wirtgen [Download PostScript] [Download PDF] [Abstract] |
|
| 85179 |
Parallel Real-Time Videotransmission over Lossy Channels
Christoph Guenzel, Falko Riemenschneider, Juergen Wirtgen [Download PostScript] [Download PDF] [Abstract] |
|
| 85180 |
Ultrafast Randomized Parallel Construction- and Approximation Algorithms for Spanning Forests in Dense Graphs
Anders Dessmark, Carsten Dorgerloh, Andrzej Lingas, Juergen Wirtgen [Download PostScript] [Download PDF] [Abstract] |
|
| 85181 |
On the Power of Randomized Ordered Branching Programs
Farid Ablayev, Marek Karpinski [Download PostScript] [Download PDF] [Abstract] |
|
| 85182 |
On Approximation Intractability of the Bandwidth Problem
Gunter Blache, Marek Karpinski, Juergen Wirtgen [Download PostScript] [Download PDF] [Abstract] |
|
| 85183 |
Complexity of Deciding Solvability of Polynomial Equations over p-adic Integers
Alexander Chistov, Marek Karpinski [Download PostScript] [Download PDF] [Abstract] |
|
|
Last Change:
02/04/03 at 10:30:35
|
Universität Bonn -> Institut für Informatik -> Abteilung V | |