The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Bruno Simeone: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Enrico Martino, Bruno Simeone, Tommaso Toffoli
    An Automatic River Planning Operating System (ARPOS). [Citation Graph (0, 0)][DBLP]
    Optimization Techniques, 1973, pp:241-250 [Conf]
  2. Mario Lucertini, Yehoshua Perl, Bruno Simeone
    Image enhancement by path partitioning. [Citation Graph (0, 0)][DBLP]
    Recent Issues in Pattern Analysis and Recognition, 1989, pp:12-22 [Conf]
  3. Brigitte Jaumard, P. Marchioro, Aurora Morgana, Rossella Petreschi, Bruno Simeone
    On Line 2-Satisfiability. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 1990, v:1, n:, pp:- [Journal]
  4. Peter L. Hammer, Bruno Simeone
    The splittance of a graph. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1981, v:1, n:3, pp:275-284 [Journal]
  5. Gabriela Alexe, Sorin Alexe, Yves Crama, Stephan Foldes, Peter L. Hammer, Bruno Simeone
    Consensus algorithms for the generation of all maximal bicliques. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:145, n:1, pp:11-21 [Journal]
  6. Endre Boros, Peter L. Hammer, Federica Ricca, Bruno Simeone
    Combinatorial problems related to origin-destination matrices. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:115, n:1-3, pp:15-36 [Journal]
  7. Endre Boros, Isabella Lari, Bruno Simeone
    Block linear majorants in quadratic 0-1 optimization. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:145, n:1, pp:52-71 [Journal]
  8. Peter L. Hammer, Alexander Kogan, Bruno Simeone, Sándor Szedmák
    Pareto-optimal patterns in logical analysis of data. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:144, n:1-2, pp:79-102 [Journal]
  9. Peter L. Hammer, Yanpei Liu, Bruno Simeone, Sándor Szedmák
    Saturated systems of homogeneous boxes and the logical analysis of numerical data. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:144, n:1-2, pp:103-109 [Journal]
  10. Yanpei Liu, Aurora Morgana, Bruno Simeone
    A Linear Algorithm for 2-bend Embeddings of Planar Graphs in the Two-dimensional Grid. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:81, n:1-3, pp:69-91 [Journal]
  11. Mario Lucertini, Giovanni Rinaldi, Antonio Sassano, Bruno Simeone
    Preface. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1995, v:62, n:1-3, pp:1-3 [Journal]
  12. Mario Lucertini, Yehoshua Perl, Bruno Simeone
    Most Uniform Path Partitioning and its Use in Image Processing. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1993, v:42, n:2, pp:227-256 [Journal]
  13. Uri N. Peled, Bruno Simeone
    A O(nm)-Time Algorithm for Computing the Dual of a Regular Boolean Function. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1994, v:49, n:1-3, pp:309-323 [Journal]
  14. Pierre Hansen, Brigitte Jaumard, Bruno Simeone
    Polynomial algorithms for nested univariate clustering. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:245, n:1-3, pp:93-105 [Journal]
  15. Endre Boros, Yves Crama, Bruno Simeone
    Peter Ladislaw Hammer: December 23, 1936-December 27, 2006. [Citation Graph (0, 0)][DBLP]
    J. Heuristics, 2007, v:13, n:2, pp:95-98 [Journal]
  16. Brigitte Jaumard, Bruno Simeone
    On the Complexity of the Maximum Satisfiability Problem for Horn Formulas. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1987, v:26, n:1, pp:1-4 [Journal]
  17. Rossella Petreschi, Bruno Simeone
    A Switching Algorithm for the Solution of Quadratic Boolean Equations. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1980, v:11, n:4/5, pp:193-198 [Journal]
  18. Ronald I. Becker, Isabella Lari, Mario Lucertini, Bruno Simeone
    A Polynomial-Time Algorithm for Max-Min Partitioning of Ladders. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2001, v:34, n:4, pp:353-374 [Journal]
  19. Nicola Apollonio, Lou Caccetta, Bruno Simeone
    Cardinality constrained path covering problems in grid graphs. [Citation Graph (0, 0)][DBLP]
    Networks, 2004, v:44, n:2, pp:120-131 [Journal]
  20. Ronald I. Becker, Isabella Lari, Mario Lucertini, Bruno Simeone
    Max-min partitioning of grid graphs into connected components. [Citation Graph (0, 0)][DBLP]
    Networks, 1998, v:32, n:2, pp:115-125 [Journal]
  21. Peter L. Hammer, Bruno Simeone, Thomas M. Liebling, Dominique de Werra
    From Linear Separability to Unimodality: A Hierarchy of Pseudo-Boolean Functions. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1988, v:1, n:2, pp:174-184 [Journal]
  22. Ronald I. Becker, Bruno Simeone, Yen-I Chiang
    A shifting algorithm for continuous tree partitioning. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:282, n:2, pp:353-380 [Journal]
  23. Endre Boros, Yves Crama, Bruno Simeone
    Peter L. Hammer (1936-2006). [Citation Graph (0, 0)][DBLP]
    4OR, 2007, v:5, n:1, pp:1-4 [Journal]
  24. P. Marchioro, Aurora Morgana, Rossella Petreschi, Bruno Simeone
    Degree sequences of matrogenic graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1984, v:51, n:1, pp:47-61 [Journal]
  25. P. Marchioro, Aurora Morgana, Rossella Petreschi, Bruno Simeone
    Adamant digraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1988, v:69, n:3, pp:253-261 [Journal]
  26. Endre Boros, Yves Crama, Bruno Simeone
    Peter Ladislaw Hammer. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:17-18, pp:2153-2155 [Journal]

  27. Weighted Voronoi Region Algorithms for Political Districting. [Citation Graph (, )][DBLP]


  28. A pseudo-Boolean consensus approach to nonlinear 0-1 optimization. [Citation Graph (, )][DBLP]


  29. Erratum. [Citation Graph (, )][DBLP]


  30. Recognition of a class of unimodular functions. [Citation Graph (, )][DBLP]


  31. On the equivalence of paved-duality and standard linearization in nonlinear 0-1 optimization. [Citation Graph (, )][DBLP]


  32. Computing sharp bounds for hard clustering problems on trees. [Citation Graph (, )][DBLP]


  33. Bicolored graph partitioning, or: gerrymandering at its worst. [Citation Graph (, )][DBLP]


Search in 0.340secs, Finished in 0.341secs
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