The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Ulrich Faigle: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Ulrich Faigle, Alexander Schoenhuth
    Note on Negative Probabilities and Observable Processes. [Citation Graph (0, 0)][DBLP]
    Algorithms for Optimization with Incomplete Information, 2005, pp:- [Conf]
  2. Ulrich Faigle, György Turán
    Sorting and Recognition Problems for Ordered Sets. [Citation Graph (0, 0)][DBLP]
    STACS, 1985, pp:109-118 [Conf]
  3. Ulrich Faigle
    The Bandwidth of Planar Distributive Lattices. [Citation Graph (0, 0)][DBLP]
    WG, 1986, pp:94-105 [Conf]
  4. Ulrich Faigle, Walter Kern
    Some Order Dimension Bounds for Communication Complexity Problems. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1991, v:28, n:6, pp:593-601 [Journal]
  5. Ulrich Faigle, Walter Kern, György Turán
    On the performance of on-line algorithms for partition problems. [Citation Graph (0, 0)][DBLP]
    Acta Cybern., 1989, v:9, n:2, pp:107-119 [Journal]
  6. Lars Kaderali, Thomas Zander, Ulrich Faigle, Jürgen Wolf, Joachim L. Schultze, Rainer Schrader
    CASPAR: a hierarchical bayesian approach to predict survival times in cancer from gene expression data. [Citation Graph (0, 0)][DBLP]
    Bioinformatics, 2006, v:22, n:12, pp:1495-1502 [Journal]
  7. Ulrich Faigle, Bill Sands
    A size-width inequality for distributive lattices. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1986, v:6, n:1, pp:29-33 [Journal]
  8. Ulrich Faigle, R. Garbe, Walter Kern
    Randomized Online Algorithms for Maximizing Busy Time Interval Scheduling. [Citation Graph (0, 0)][DBLP]
    Computing, 1996, v:56, n:2, pp:95-104 [Journal]
  9. Péter L. Erdös, Ulrich Faigle, Walter Kern
    A Group-Theoretic Setting for Some Intersecting Sperner Families. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1992, v:1, n:, pp:323-334 [Journal]
  10. Ulrich Faigle, Noud Gademann, Walter Kern
    A Random Polynomial Time Algorithm for Well-rounding Convex Bodies. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1995, v:58, n:2, pp:117-144 [Journal]
  11. Ulrich Faigle, Kees Hoede
    Preface. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1994, v:51, n:1-2, pp:1- [Journal]
  12. Ulrich Faigle, Kees Hoede
    Preface. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1997, v:79, n:1-3, pp:1- [Journal]
  13. Ulrich Faigle, Willem M. Nawijn
    Note on Scheduling Intervals on-line. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1995, v:58, n:1, pp:13-17 [Journal]
  14. 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]
  15. Ulrich Faigle, Rainer Schrader, György Turán
    The Communication Complexity of Interval Orders. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1992, v:40, n:1, pp:19-28 [Journal]
  16. Ulrich Faigle, Johann Hurink, Stefan Wolfgang Pickl
    Preface. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2006, v:154, n:9, pp:1315- [Journal]
  17. Ulrich Faigle, Gereon Frahling
    A combinatorial algorithm for weighted stable sets in bipartite graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2006, v:154, n:9, pp:1380-1391 [Journal]
  18. Ulrich Faigle, Sándor P. Fekete, Winfried Hochstättler, Walter Kern
    The Nucleon of Cooperative Games and an Algorithm for Matching Games [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1995, v:2, n:7, pp:- [Journal]
  19. Ulrich Faigle, Sándor P. Fekete, Winfried Hochstättler, Walter Kern
    On the Complexity of Testing Membership in the Core of min-Cost Spanning Tree Games [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1995, v:2, n:12, pp:- [Journal]
  20. Ulrich Faigle, Walter Kern, M. Streng
    Note On the Computational Complexity of j-Radii of Polytopes in Rn [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1995, v:2, n:14, pp:- [Journal]
  21. Ulrich Faigle, Sándor P. Fekete, Winfried Hochstättler, Walter Kern
    On Approximately Fair Cost Allocation in Euclidean TSP Games [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1995, v:2, n:16, pp:- [Journal]
  22. Ulrich Faigle, Rainer Schrader
    Minimizing Completion Time for a Class of Scheduling Problems. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1984, v:19, n:1, pp:27-29 [Journal]
  23. Ulrich Faigle, Rainer Schrader
    On the Convergence of Stationary Distributions in Simulated Annealing Algorithms. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1988, v:27, n:4, pp:189-194 [Journal]
  24. Ulrich Faigle
    On Ordered Languages and the Optimization of Linear Functions by Greedy Algorithms [Citation Graph (0, 0)][DBLP]
    J. ACM, 1985, v:32, n:4, pp:861-870 [Journal]
  25. Ulrich Faigle, Walter Kern, Willem M. Nawijn
    A Greedy On-Line Algorithm for thek-Track Assignment Problem. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1999, v:31, n:1, pp:196-210 [Journal]
  26. Ulrich Faigle
    Geometries on partially ordered sets. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1980, v:28, n:1, pp:26-51 [Journal]
  27. Ulrich Faigle, Walter Kern
    Submodular linear programs on forests. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1996, v:72, n:, pp:195-206 [Journal]
  28. Ulrich Faigle, Walter Kern, Sándor P. Fekete, Winfried Hochstättler
    The nucleon of cooperative games and an algorithm for matching games. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1998, v:83, n:, pp:195-211 [Journal]
  29. Ulrich Faigle, Walter Kern, M. Streng
    Note on the computational complexity of j-radii of polytopes in Realn. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1996, v:73, n:, pp:1-5 [Journal]
  30. Ulrich Faigle, Walter Kern
    An Order-theoretic Framework for the Greedy Algorithm with Applications to the Core and Weber Set of Cooperative Games. [Citation Graph (0, 0)][DBLP]
    Order, 2000, v:17, n:4, pp:353-375 [Journal]
  31. Ulrich Faigle, Gerhard Gierz, Rainer Schrader
    Algorithmic approaches to setup minimization. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1985, v:14, n:4, pp:954-965 [Journal]
  32. Ulrich Faigle, László Lovász, Rainer Schrader, György Turán
    Searching in Trees, Series-Parallel and Interval Orders. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1986, v:15, n:4, pp:1075-1084 [Journal]
  33. Ulrich Faigle, György Turán
    Sorting and Recognition Problems for Ordered Sets. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1988, v:17, n:1, pp:100-113 [Journal]
  34. Ulrich Faigle, Walter Kern
    Approximate Core Allocation for Binpacking Games. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1998, v:11, n:3, pp:387-399 [Journal]
  35. Péter L. Erdös, Ulrich Faigle, Winfried Hochstättler, Walter Kern
    Note on the game chromatic index of trees. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:303, n:3, pp:371-376 [Journal]
  36. Ulrich Faigle, Rainer Schrader
    Simulted Annealing -Eine Fallstudie. [Citation Graph (0, 0)][DBLP]
    Angewandte Informatik, 1988, v:30, n:6, pp:259-263 [Journal]
  37. Ulrich Faigle, Bernhard Fuchs, Britta Peis
    Note on maximal split-stable subgraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:15, pp:2031-2038 [Journal]
  38. Ulrich Faigle, Rainer Schrader
    A combinatorial bijection between linear extensions of equivalent orders. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1986, v:58, n:3, pp:295-301 [Journal]
  39. Ulrich Faigle, György Turán
    On the complexity of interval orders and semiorders. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1987, v:63, n:2-3, pp:131-141 [Journal]
  40. Péter L. Erdös, Ulrich Faigle, Walter Kern
    On the average rank of LYM-sets. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:144, n:1-3, pp:11-22 [Journal]

  41. Choquet Integration on Set Systems. [Citation Graph (, )][DBLP]


  42. Two-phase greedy algorithms for some classes of combinatorial linear programs. [Citation Graph (, )][DBLP]


  43. A Hierarchical Model for Cooperative Games. [Citation Graph (, )][DBLP]


  44. A Monge Algorithm for Computing the Choquet Integral on Set Systems. [Citation Graph (, )][DBLP]


  45. A System-Theoretic Model for Cooperation and Allocation Mechanisms. [Citation Graph (, )][DBLP]


  46. A two-phase greedy algorithm for modular lattice polyhedra. [Citation Graph (, )][DBLP]


  47. Preface for CTW2005 special issue. [Citation Graph (, )][DBLP]


  48. A greedy reduction algorithm for setup optimization. [Citation Graph (, )][DBLP]


  49. An algorithmic characterization of antimatroids. [Citation Graph (, )][DBLP]


  50. The permutahedron of series-parallel posets. [Citation Graph (, )][DBLP]


  51. Modeling and simulation of nitrogen regulation in Corynebacterium glutamicum. [Citation Graph (, )][DBLP]


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


Search in 0.346secs, Finished in 0.347secs
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