The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Johann Hurink: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Lodewijk T. Smit, Gerard J. M. Smit, Johann Hurink
    Run-Time Adaptation of a Reconfigurable Mobile UMTS Receiver. [Citation Graph (0, 0)][DBLP]
    ERSA, 2004, pp:313- [Conf]
  2. Lodewijk T. Smit, Gerard J. M. Smit, Johann Hurink, André B. J. Kokkeler
    Soft Output Bit Error Rate Estimation for WCDMA. [Citation Graph (0, 0)][DBLP]
    PWC, 2003, pp:448-457 [Conf]
  3. Lodewijk T. Smit, Gerard J. M. Smit, Johann Hurink, Gerard K. Rauwerda
    BER Estimation for HiperLAN/2. [Citation Graph (0, 0)][DBLP]
    PWC, 2004, pp:164-179 [Conf]
  4. Tim Nieberg, Johann Hurink
    A PTAS for the Minimum Dominating Set Problem in Unit Disk Graphs. [Citation Graph (0, 0)][DBLP]
    WAOA, 2005, pp:296-306 [Conf]
  5. Tim Nieberg, Johann Hurink, Walter Kern
    A Robust PTAS for Maximum Weight Independent Sets in Unit Disk Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 2004, pp:214-221 [Conf]
  6. Peter Brucker, Thomas Hilbig, Johann Hurink
    A Branch and Bound Algorithm for a Single-machine Scheduling Problem with Positive, Negative Time-lags. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1999, v:94, n:1-3, pp:77-99 [Journal]
  7. Peter Brucker, Johann Hurink, Bernd Jurisch, Birgit Wöstmann
    A Branch & Bound Algorithm for the Open-shop Problem. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1997, v:76, n:1-3, pp:43-59 [Journal]
  8. Peter Brucker, Johann Hurink, Frank Werner
    Improving Local Search Heuristics for Some Scheduling Problems-I. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1996, v:65, n:1-3, pp:97-122 [Journal]
  9. Peter Brucker, Johann Hurink, Frank Werner
    Improving Local Search Heuristics for some Scheduling Problems. Part II. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1997, v:72, n:1-2, pp:47-69 [Journal]
  10. Ulrich Faigle, Stefan Pickl, Hajo Broersma, Johann Hurink
    Preface: The 1st Cologne-Twente Workshop on Graphs and Combinatorial Optimization. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:136, n:2-3, pp:159-160 [Journal]
  11. Johann Hurink
    Polygon Scheduling. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1996, v:70, n:1, pp:37-55 [Journal]
  12. Johann Hurink, Jens Keuchel
    Local search algorithms for a single-machine scheduling problem with positive and negative time-lags. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:112, n:1-3, pp:179-197 [Journal]
  13. Johann Hurink, Sigrid Knust
    Makespan minimization for flow-shop problems with transportation times and a single robot. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:112, n:1-3, pp:199-216 [Journal]
  14. Johann Hurink, Sigrid Knust
    A tabu search algorithm for scheduling a single robot in a job-shop environment. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2002, v:119, n:1-2, pp:181-203 [Journal]
  15. Ulrich Faigle, Johann Hurink, Stefan Wolfgang Pickl
    Preface. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2006, v:154, n:9, pp:1315- [Journal]
  16. Peter Brucker, Silvia Heitmann, Johann Hurink
    How useful are preemptive schedules? [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2003, v:31, n:2, pp:129-136 [Journal]
  17. Tobias Brueggemann, Johann Hurink, Walter Kern
    Quality of move-optimal schedules for minimizing total weighted completion time. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2006, v:34, n:5, pp:583-590 [Journal]
  18. Johann Hurink, Sigrid Knust
    List scheduling in a parallel machine environment with precedence constraints and setup times. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2001, v:29, n:5, pp:231-239 [Journal]
  19. Johann Hurink, Sigrid Knust
    Tabu search algorithms for job-shop problems with a single transport robot. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2005, v:162, n:1, pp:99-111 [Journal]

  20. Demonstration of Run-time Spatial Mapping of Streaming Applications to a Heterogeneous Multi-Processor System-on-Chip (MPSOC). [Citation Graph (, )][DBLP]


  21. Run-time Spatial Mapping of Streaming Applications to a Heterogeneous Multi-Processor System-on-Chip (MPSOC). [Citation Graph (, )][DBLP]


  22. Run-time spatial resource management for real-time applications on heterogeneous MPSoCs. [Citation Graph (, )][DBLP]


  23. A Generalized Clustering Algorithm for Dynamic Wireless Sensor Networks. [Citation Graph (, )][DBLP]


  24. Online Algorithm for Parallel Job Scheduling and Strip Packing. [Citation Graph (, )][DBLP]


  25. Very Large-Scale Neighborhoods with Performance Guarantees for Minimizing Makespan on Parallel Machines. [Citation Graph (, )][DBLP]


  26. Simulating the Effect on the Energy Efficiency of Smart Grid Technologies. [Citation Graph (, )][DBLP]


  27. Approximating minimum independent dominating sets in wireless networks. [Citation Graph (, )][DBLP]


  28. Decomposition method for project scheduling with adjacent resources. [Citation Graph (, )][DBLP]


  29. Special Cases of Online Parallel Job Scheduling. [Citation Graph (, )][DBLP]


  30. An analysis of the lifetime of OLSR networks. [Citation Graph (, )][DBLP]


  31. Time-constrained project scheduling with adjacent resources. [Citation Graph (, )][DBLP]


  32. Cologne/Twente workshop on graphs and combinatorial optimization CTW 2007. [Citation Graph (, )][DBLP]


Search in 0.005secs, Finished in 0.007secs
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