37th International Conference on Current Trends in Theory and Practice of Computer Science

Preliminary schedule

    
 

Sunday, January 23

 
    
 

9:00—10:20

Juerg Gutknecht: Hardware/ software codesign at work (invited talk)

 
    
 

10:45 – 11:10

Tobias Moemke. Structural Properties of Hard Metric TSP Inputs

 
  

Mohammad Amin Fazli, Morteza Saghafian, Shayan Ehsani, MohammadAli Safari, Mohammad Tavakkoli and Mohammad Ghodsi. White Space Regions

 
 

11:10 – 11:35

Johan Kwisthout, Hans L. Bodlaender and Linda C. van der Gaag. The Complexity of Finding kth Most Probable Explanations in Probabilistic Networks

 
  

Robert Ganian. New Results on the Complexity of the Max- and Min-Rep Problems

 
 

11:35 – 12:00

 Matus Mihalak, Marcel Schoengens, Rastislav Sramek and Peter Widmayer. On the Complexity of the metric TSP under Stability Considerations

 
  

Ahti Peder and Mati Tombak. Finding the Description of Structure by Counting Method: a Case Study

 
    
 

12:00 - 13:00

lunch

 
    
 

15:30 -16:50

Ulrich Ruhrmair: Physical Cryptography, Or: How to Realize Cryptography and Security by Random, Disordered, and Unclonable Physical Structures (invited talk)

 
    
 

17:00 - 17:25

Markus Geyer, Michael Kaufmann, Tamara Mchedlidze and Antonios Symvonis. Upward Point-Set Embeddability

 
  

Piotr Borowiecki and Frank Goering. GreedyMAX-type algorithms for the maximum independent set problem

 
 

17:25 – 17:50

Christian Komusiewicz and Johannes Uhlmann. Alternative Parameterizations for Cluster Editing

 
  

Arnold Overwijk, Eelko Penninkx and Hans L. Bodlaender. A Local Search Algorithm for Branchwidth

 
 

17:50 – 18:15

Igor Chikalov, Shahid Hussain and Mikhail Moshkov. Sequential Optimization of Matrix Chain Multiplication Relative to Different Cost Functions

 
  

Andreas Gemsa, Martin Nöllenburg, Thomas Pajor and Ignaz Rutter. On d-regular Schematization of Embedded Paths

 
    
 

19:00 – 20:00

dinner

 
    
    
 

Monday, January 24

 
    
 

9:00—10:20

Christian Cachin: Integrity and Consistency for Untrusted Services (invited talk)

 
    
 

10:45 – 11:10

Beate Bollig and Marc Gille. Randomized OBDDs for the most significant bit of integer multiplication

 
  

Stefan Schiffner, Sebastian Clauß and Sandra Steinbrecher. Privacy, Liveliness and Fairness for Reputation

 
 

11:10 – 11:35

Dennis Komm and Richard Kralovic. Advice Complexity and Barely Random Algorithms

 
  

Yoni De Mulder, Karel Wouters and Bart Preneel. A Privacy-preserving Group Key Agreement Scheme

 
 

11:35 – 12:00

Viliam Geffert and Jozef Gajdoš. In-Place Sorting

 
  

Matteo Zanioli and Agostino Cortesi. Information Leakage Analysis by Abstract Interpretation

 
    
 

12:00 - 13:00

lunch

 
    
 

15:30 -19:00

Student Reseach Forum

 
    
 

19:00 – 20:00

dinner

 
    
    
 

Tuesday, January 25

 
    
 

9:00—10:20

Tony Hey:  The Fourth Paradigm: Data-Intensive Science (invited talk)

 
    
 

10:45 – 11:10

Gianlorenzo D'Angelo, Gabriele Di Stefano and Alfredo Navarra. Bandwidth constrained multi-interface networks

 
  

Romain Beauxis, David Baelde and Samuel Mimram. liquidsoap: a high-level programming language for multimedia streaming

 
 

11:10 – 11:35

Haisheng Tan, Tiancheng Lou, Francis Lau, Yuexuan Wang and Shiteng Chen. Minimizing interference for the highway model in Wireless Ad-hoc and Sensor Networks

 
  

Ferenc Havasi. An improved B+ tree for flash file systems

 
 

11:35 – 12:00

Gianlorenzo D'Angelo, Gabriele Di Stefano and Alfredo Navarra. Min-Max Coverage in Multi-Interface Networks

 
  

Tibor Bakota. Tracking the Evolution of Code Clones

 
    
 

12:00 - 13:00

lunch

 
    
 

15:30 -16:50

Rainer Koschke: Begun the Software Clone War has (invited talk)

 
    
 

17:00 - 17:25

Krzysztof Kaczmarski. Comparing CPU and GPU in OLAP Cubes Creation

 
  

Petr Praus, Slávka Jaroměřská and Tomáš Černý. SScAC: Towards a framework for small-scale software architectures comparison

 
 

17:25 – 17:50

Michael Vassilakopoulos, Antonio Corral and Nikitas Karanikolas. Join-Queries between two Spatial Datasets Indexed by a Single R*-tree

 
  

Iulian Ober and Iulia Dragomir. Unambiguous UML composite structures: the OMEGA2 experience

 
 

17:50 – 18:15

Tobias Langner, Alexander Souza and Christian Schindelhauer. Optimal File-Distribution in Heterogeneous and Asymmetric Storage Networks

 
  

Jong-Phil Kim, Doo-Hwan Kim and Jang-Eui Hong. A Power Consumption Analysis Technique using UML-based Design Models in Embedded Software Development

 
    
 

19:00 – 20:00

dinner

 
    
    
 

Wednesday, January 26

 
    
 

9:00—10:20

Tomas Vojnar: Efficient Algorithms for Checking Inclusion on Nondeterministic Automata (invited talk)

 
    
 

10:40 – 12:00

Marcus Gross: Visualization based on physical and geometric modeling. (invited talk)

 
    
 

12:00 - 13:00

lunch

 
    
 

14:00 - ?

Conference trip

 
    
    
    
 

Thursday, January 27

 
    
 

9:00—10:20

Jiri Srba: Verification of Timed-Arc Petri Nets (invited talk)

 
    
 

10:45 – 11:10

Nadja Betzler, Robert Bredereck, Rolf Niedermeier and Johannes Uhlmann. On Making a Distinguished Vertex Minimum Degree by Vertex Deletion

 
  

Raju Halder and Agostino Cortesi. Cooperative Query Answering by Abstract Interpretation

 
 

11:10 – 11:35

David Peleg, Ignasi Sau and Mordechai Shalom. On approximating the $d$-girth of a graph

 
  

Evmorfia Argyriou, Michael Bekos and Antonios Symvonis. The Straight-Line RAC Drawing Problem is NP-Hard

 
 

11:35 – 12:00

Johan M. M. van Rooij, Marcel E. van Kooten Niekerk and Hans L. Bodlaender. Partition Into Triangles on Bounded Degree Graphs

 
  

Andreas Cord-Landwehr, Bastian Degener, Matthias Fischer, et al. Collision-less gathering of robots with an extent

 
    
 

12:00 - 13:00

lunch

 
    
 

15:30 -16:50

Vitaly Shmatikov: Anonymity and Data Privacy: Yesterday, Today, and Tomorrow (invited talk)

 
    
 

17:00 -17:25

Alexander Okhotin. Comparing linear conjunctive languages to subfamilies of the context-free languages

 
   

Michael Bekos, Michael Kaufmann, Dimitrios Papadopoulos and Antonios Symvonis. Combining Traditional Map Labeling with Boundary Labeling

 
 

17:25 – 17:50

Benedek Nagy and Friedrich Otto. An automata-theoretical characterization of context-free trace languages

 
   

Michel Reniers and Tim Willemse. Folk Theorems on the Correspondence between State-Based and Event-Based Systems

 
 

17:50 – 18:15

Ehsan Chiniforooshan, Mark Daley, Oscar Ibarra, Lila Kari and Shinnosuke Seki. One-reversal counter machines and multihead automata: revisited

 
    
 

19:00 – 20:00

dinner

 
    
    

Proceedings



Created using Fluid 960 Grid, and Sofsems' webs. © Faculty of Mathematics, Physics, and Computer Science, Comenius University, 2010