The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Nicole Megow: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Nicole Megow, Marc Uetz, Tjark Vredeveld
    Models and Algorithms for Stochastic Online Scheduling. [Citation Graph (0, 0)][DBLP]
    Algorithms for Optimization with Incomplete Information, 2005, pp:- [Conf]
  2. Nicole Megow, Tjark Vredeveld
    Approximation in Preemptive Stochastic Online Scheduling. [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:516-527 [Conf]
  3. Sven Oliver Krumke, Nicole Megow, Tjark Vredeveld
    How to Whack Moles. [Citation Graph (0, 0)][DBLP]
    WAOA, 2003, pp:192-205 [Conf]
  4. Nicole Megow, Andreas S. Schulz
    Scheduling to Minimize Average Completion Time Revisited: Deterministic On-Line Algorithms. [Citation Graph (0, 0)][DBLP]
    WAOA, 2003, pp:227-234 [Conf]
  5. Stefan Heinz, Sven Oliver Krumke, Nicole Megow, Jörg Rambau, Andreas Tuchscherer, Tjark Vredeveld
    The Online Target Date Assignment Problem. [Citation Graph (0, 0)][DBLP]
    WAOA, 2005, pp:230-243 [Conf]
  6. Nicole Megow, Marc Uetz, Tjark Vredeveld
    Stochastic Online Scheduling on Parallel Machines. [Citation Graph (0, 0)][DBLP]
    WAOA, 2004, pp:167-180 [Conf]
  7. Nicole Megow, Andreas S. Schulz
    On-line scheduling to minimize average completion time revisited. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2004, v:32, n:5, pp:485-490 [Journal]
  8. Sandra Gutiérrez, Sven Oliver Krumke, Nicole Megow, Tjark Vredeveld
    How to whack moles. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:361, n:2-3, pp:329-341 [Journal]

  9. Universal Sequencing on a Single Machine. [Citation Graph (, )][DBLP]


  10. Scheduling Real-Time Mixed-Criticality Jobs. [Citation Graph (, )][DBLP]


  11. Algorithms and Complexity for Periodic Real-Time Scheduling. [Citation Graph (, )][DBLP]


  12. Scheduling and Packing Malleable Tasks with Precedence Constraints of Bounded Width. [Citation Graph (, )][DBLP]


  13. Coping with Incomplete Information in Scheduling - Stochastic and Online Models. [Citation Graph (, )][DBLP]


  14. Cardinality Constrained Graph Partitioning into Cliques with Submodular Costs. [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