| |
On-Line Algorithms, Bioinformatics, and SAT Solving
On-Line Algorithms, Bioinformatics, and SAT Solving (OLABS)
is funded by a DKK 1,267,200.00 grant from the
Danish Natural Science Research Council from January 1, 2011 through December 31, 2013.
Participants
Environment
The project is carried out at the
Department of Mathematics and Computer Science (IMADA)
at the
University of Southern Denmark.
The group of participants are associated with the
Research Training
Program on Efficient Algorithms and High Quality Solutions.
Publications since January 1, 2011
Peer-Reviewed International Journal Articles
- On the Absolute Approximation Ratio for First Fit
and Related Results.
- Joan Boyar, György Dósa, Leah Epstein.
Discrete Applied Mathematics, 2012. Accepted for publication.
- SAT Solving for Termination Proofs with
Recursive Path Orders and Dependency Pairs.
- Michael Codish, Jürgen Giesl, Peter Schneider-Kamp, René
Thiemann.
Journal of Automated Reasoning, 2011. Accepted for publication.
- Proving Termination by Dependency Pairs and
Inductive Theorem Proving
- Carsten Fuhs, Jürgen Giesl, Michael Parting, Peter
Schneider-Kamp, and Stephan Swiderski.
Journal of Automated Reasoning, 47(2):133-160, 2011.
- CATCHprofiles: Clustering and Alignment
Tool for ChIP Profiles.
- Fiona G. G. Nielsen, Kasper G. Markus, Rune M. Friborg, Lene M.
Favrholdt, Hendrik G. Stunnenberg, and Martijn Huynen
PLoS ONE, 7(1), 2012.
DOI:10.1371/journal.pone.0028272.
- Online Variable-Sized Bin Packing with
Conflicts.
- Leah Epstein, Lene M. Favrholdt, and Asaf Levin.
Discrete Optimization, 8(2): 333-343, 2011.
- List Factoring and Relative Worst Order Analysis.
- Martin R. Ehmsen, Jens S. Kohrt, and Kim S. Larsen.
Algorithmica. Accepted for publication.
- Logic Minimization Techniques with Applications to Cryptology.
- Joan Boyar and René Peralta.
Journal of Cryptology. Accepted for publication.
- A New Variable-Sized Bin Packing Problem.
- Joan Boyar and Lene M. Favrholdt.
Journal of Scheduling, 15(3):273-287, 2012.
- The Cost of Cache-Oblivious
Searching.
- Michael A. Bender, Gerth S. Brodal, Rolf Fagerberg, Dongdong Ge, Simai
He, Haodong Hu, John Iacono, and Alejandro López-Ortiz.
Algorithmica, 61(2):463-505, 2011.
- Finding All Sorting Tandem Duplication Random Loss Operations.
- M. Bernt, K.-Y. K.Y. Chen, M.C. Chen, A.-C. Chu, D. Merkle, H.-L. Wang, K.-M. Chao, and M. Middendorf.
Journal of Discrete Algorithms. Accepted for publication.
- Comparing Online Algorithms for Bin Packing Problems.
- Leah Epstein, Lene M. Favrholdt, and Jens S. Kohrt.
Journal of Scheduling, 15(1): 13-21, 2012.
DOI:10.1007/s10951-009-0129-5.
- Polytool: Polynomial Interpretations as a
Basis for Termination Analysis of Logic Programs.
- Manh Thang Nguyen, Danny De Schreye, Jürgen Giesl, and Peter
Schneider-Kamp.
Theory and Practice of Logic Programming, 11(1): 33-63, 2011.
- Automated Termination Proofs for Haskell by
Term Rewriting.
- Jürgen Giesl, Matthias Raffelsieper, Peter Schneider-Kamp, Stephan
Swiderski, and René Thiemann.
ACM Transactions on Programming Languages and Systems, 33(2),
2011.
Peer-Reviewed International Conference Articles
- De-amortizing Binary Search Trees
- Prosenjit Bose, Rolf Fagerberg, Sébastien, Stefan Langerman
To appear in Proceedings of 39th International Colloquium on
Automata,
Languages and Programming (ICALP), 2012.
- On Plane Constrained Bounded-Degree
Spanners.
- Prosenjit Bose, Rolf Fagerberg, André van Renssen, Sander Verdonschot
In Proceedings of 10th Latin American Theoretical Informatics
Symposium (LATIN), volume 7256 of LNCS, pages 85-96. Springer Verlag,
2012.
- Competitive Routing in the
Half-Theta-6-Graph.
- Prosenjit Bose, Rolf Fagerberg, André van Renssen, Sander Verdonschot
In Proceedings of the Twenty-third Annual ACM-SIAM Symposium on
Discrete Algorithms, 1319-1328, 2012.
-
Access Graphs Results for LRU versus FIFO under Relative Worst Order Analysis.
- Joan Boyar, Sushmita Gupta and Kim S. Larsen.
In 13th Scandinavian Symposium and Workshops on Algorithm Theory. Accepted for publication.
- Optimal Base Encodings for Pseudo-Boolean
Constraints
- Michael Codish, Yoav Fekete, Carsten Fuhs, and Peter Schneider-Kamp.
In 17th International Conference on Tools and Algorithms for the
Construction and Analysis of Systems, volume 6605 of Lecture
Notes in Computer Science, 189-204, 2011. Springer.
- A Linear Operational Semantics for
Termination and Complexity Analysis of ISO Prolog
- Thomas Ströder, Fabian Emmes, Peter Schneider-Kamp, Jürgen
Giesl, and Carsten Fuhs.
In Proceedings of the 21st International Symposium on Logic-Based
Program Synthesis and Transformation (LOPSTR '11), Lecture Notes in
Computer Science. Accepted for publication.
- A Comparison of Performance Measures via Online Search.
- Joan Boyar, Kim S. Larsen, and Abyayananda Maiti.
In SIAM Joint FAW-AAIM Conference, volume 7285 of Lecture Notes in Computer Science, pages 303-314, Springer, 2012.
- A Small Depth-16 Circuit for the AES S-Box
- Joan Boyar and René Peralta.
In Proceedings of IFIP SECURITY 2012. Accepted for publication.
- Dependency Triples for Improving
Termination Analysis of Logic Programs with Cut.
- Thomas Ströder, Peter Schneider-Kamp, and Jürgen Giesl.
In Twentieth International Symposium on Logic-Based Program
Synthesis and Transformation, volume 6564 of Lecture Notes in
Computer Science, 184-199, 2011. Springer.
- List Factoring and Relative Worst Order Analysis.
- Martin R. Ehmsen, Jens S. Kohrt, and Kim S. Larsen.
In Eighth Workshop on Approximation and Online Algorithms,
volume 6534 of Lecture Notes in Computer Science, pages 118-129. Springer, 2011.
- Synthesizing Shortest Straight-Line
Programs over GF(2) using SAT.
- Carsten Fuhs and Peter Schneider-Kamp.
In Thirteenth International Conference on Theory and Applications
of Satisfiability Testing, volume 6175 of Lecture Notes in
Computer Science, 71-84, 2010. Springer.
- Lazy Abstraction for Size-Change
Termination.
- Michael Codish, Carsten Fuhs, Jürgen Giesl, and Peter Schneider-Kamp.
In Seventeenth International Conference on Logic for Programming,
Artificial Intelligence and Reasoning, volume 6397 of Lecture
Notes in Computer Science, 217-232, 2010. Springer.
- The Dependency Triple Framework for
Termination of Logic Programs.
- Peter Schneider-Kamp, Jürgen Giesl, and Manh Thang Nguyen.
In 19th International Symposium on Logic-Based Program Synthesis
and Transformation, volume 6037 of Lecture Notes in Computer
Science, 37-51, 2010. Springer.
Books
- Graph Edge Coloring: Vizing's Theorem and
Goldberg's Conjecture.
- Michael Stiebitz, Diego Scheide, Bjarne Toft, and Lene M. Favrholdt.
Wiley 2012.
Book Contributions (entries, chapters, and editorials)
|
|
![[SDU Logo]](http://www.imada.sdu.dk/Images/top_logo_da.gif){kind=logo}
