The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Dieter Mitsche: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Johann Eder, Christian Koncilia, Dieter Mitsche
    Analysing Slices of Data Warehouses to Detect Structural Modifications. [Citation Graph (0, 0)][DBLP]
    CAiSE, 2004, pp:492-505 [Conf]
  2. Johann Eder, Christian Koncilia, Dieter Mitsche
    Automatic Detection of Structural Changes in Data Warehouses. [Citation Graph (0, 0)][DBLP]
    DaWaK, 2003, pp:119-128 [Conf]
  3. Joachim Giesen, Dieter Mitsche
    Reconstructing Many Partitions Using Spectral Techniques. [Citation Graph (0, 0)][DBLP]
    FCT, 2005, pp:433-444 [Conf]
  4. Joachim Giesen, Dieter Mitsche
    Boosting Spectral Partitioning by Sampling and Iteration. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2005, pp:473-482 [Conf]
  5. Udo Adamy, Thomas Erlebach, Dieter Mitsche, Ingo Schurr, Bettina Speckmann, Emo Welzl
    Off-line Admission Control for Advance Reservations in Star Networks. [Citation Graph (0, 0)][DBLP]
    WAOA, 2004, pp:211-224 [Conf]
  6. Joachim Giesen, Dieter Mitsche
    Bounding the Misclassification Error in Spectral Partitioning in the Planted Partition Model. [Citation Graph (0, 0)][DBLP]
    WG, 2005, pp:409-420 [Conf]
  7. Joachim Giesen, Dieter Mitsche, Eva Schuberth
    Collaborative Ranking: An Aggregation Algorithm for Individuals' Preference Estimation. [Citation Graph (0, 0)][DBLP]
    AAIM, 2007, pp:58-67 [Conf]
  8. Josep Díaz, Dieter Mitsche, Xavier Pérez
    Dynamic Random Geometric Graphs [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  9. Josep Díaz, Dieter Mitsche, Xavier Pérez
    Sharp threshold for hamiltonicity of random geometric graphs [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]

  10. On the Number of Higher Order Delaunay Triangulations. [Citation Graph (, )][DBLP]


  11. A new upper bound for 3-SAT. [Citation Graph (, )][DBLP]


  12. On the connectivity of dynamic random geometric graphs. [Citation Graph (, )][DBLP]


  13. On the Power of Mediators. [Citation Graph (, )][DBLP]


  14. On the Probability of the Existence of Fixed-Size Components in Random Geometric Graphs [Citation Graph (, )][DBLP]


  15. A new upper bound for 3-SAT [Citation Graph (, )][DBLP]


  16. On the Number of Higher Order Delaunay Triangulations [Citation Graph (, )][DBLP]


  17. Social-Aware Forwarding Improves Routing Performance in Pocket Switched Networks [Citation Graph (, )][DBLP]


  18. Colorings at minimum cost. [Citation Graph (, )][DBLP]


  19. Online balanced graph avoidance games. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.002secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002