The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Markus Chimani: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Charles Rich, Candace L. Sidner, Neal Lesh, Andrew Garland, Shane Booth, Markus Chimani
    DiamondHelp: A Collaborative Task Guidance Framework for Complex Devices. [Citation Graph (0, 0)][DBLP]
    AAAI, 2005, pp:1700-1701 [Conf]
  2. Markus Chimani, Neal Lesh, Michael Mitzenmacher, Candy L. Sidner, Hidetoshi Tanaka
    A Case Study in Large-Scale Interactive Optimization. [Citation Graph (0, 0)][DBLP]
    Artificial Intelligence and Applications, 2005, pp:24-29 [Conf]
  3. Carsten Gutwenger, Markus Chimani
    Non-planar Core Reduction of Graphs. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2005, pp:223-234 [Conf]
  4. Charles Rich, Candy L. Sidner, Neal Lesh, Andrew Garland, Shane Booth, Markus Chimani
    DiamondHelp: A Collaborative Interface Framework for Networked Home Appliances. [Citation Graph (0, 0)][DBLP]
    ICDCS Workshops, 2005, pp:514-519 [Conf]
  5. Markus Chimani, Gunnar W. Klau, René Weiskircher
    Non-planar Orthogonal Drawings with Fixed Topology. [Citation Graph (0, 0)][DBLP]
    SOFSEM, 2005, pp:96-105 [Conf]
  6. Markus Chimani, Carsten Gutwenger, Petra Mutzel
    Experiments on Exact Crossing Minimization Using Column Generation. [Citation Graph (0, 0)][DBLP]
    WEA, 2006, pp:303-315 [Conf]
  7. Charles Rich, Candace L. Sidner, Neal Lesh, Andrew Garland, Shane Booth, Markus Chimani
    DiamondHelp: a new interaction design for networked home appliances. [Citation Graph (0, 0)][DBLP]
    Personal and Ubiquitous Computing, 2006, v:10, n:2-3, pp:187-190 [Journal]
  8. Markus Chimani, Maria Kandyba, Petra Mutzel
    A New ILP Formulation for 2-Root-Connected Prize-Collecting Steiner Networks. [Citation Graph (0, 0)][DBLP]
    ESA, 2007, pp:681-692 [Conf]
  9. Markus Chimani, Maria Kandyba, Mike Preuss
    Hybrid Numerical Optimization for Combinatorial Network Problems. [Citation Graph (0, 0)][DBLP]
    Hybrid Metaheuristics, 2007, pp:185-200 [Conf]

  10. Obtaining Optimal k-Cardinality Trees Fast. [Citation Graph (, )][DBLP]


  11. Crossing Minimization meets Simultaneous Drawing. [Citation Graph (, )][DBLP]


  12. A New Approach to Exact Crossing Minimization. [Citation Graph (, )][DBLP]


  13. Computing Maximum C-Planar Subgraphs. [Citation Graph (, )][DBLP]


  14. Approximating the Crossing Number of Apex Graphs. [Citation Graph (, )][DBLP]


  15. Efficient Extraction of Multiple Kuratowski Subdivisions. [Citation Graph (, )][DBLP]


  16. Upward Planarization Layout. [Citation Graph (, )][DBLP]


  17. Algorithms for the Hypergraph and the Minor Crossing Number Problems. [Citation Graph (, )][DBLP]


  18. Inserting a vertex into a planar graph. [Citation Graph (, )][DBLP]


  19. Approximating the Crossing Number of Graphs Embeddable in Any Orientable Surface. [Citation Graph (, )][DBLP]


  20. Layer-Free Upward Crossing Minimization. [Citation Graph (, )][DBLP]


  21. Strong Formulations for 2-Node-Connected Steiner Network Problems. [Citation Graph (, )][DBLP]


  22. Non-planar core reduction of graphs. [Citation Graph (, )][DBLP]


Search in 0.030secs, Finished in 0.032secs
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