The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

András Frank: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. András Frank, Zoltán Király, Balázs Kotnyek
    An Algorithm for Node-Capacitated Ring Routing. [Citation Graph (0, 0)][DBLP]
    ESA, 2005, pp:249-258 [Conf]
  2. András Frank
    Augmenting Graphs to Meet Edge-Connectivity Requirements [Citation Graph (0, 0)][DBLP]
    FOCS, 1990, pp:708-718 [Conf]
  3. András Frank, Éva Tardos
    An Application of Simultaneous Approximation in Combinatorial Optimization [Citation Graph (0, 0)][DBLP]
    FOCS, 1985, pp:459-463 [Conf]
  4. András Frank, Tibor Jordán
    Tree-representation of directed circuits. [Citation Graph (0, 0)][DBLP]
    Graph Structure Theory, 1991, pp:195-202 [Conf]
  5. András Frank
    Conservative Weightings and Ear-Decompositions of Graphs. [Citation Graph (0, 0)][DBLP]
    IPCO, 1990, pp:217-229 [Conf]
  6. András Frank, Tibor Jordán
    How to Make a Strongly Connected Digraph Two-Connected. [Citation Graph (0, 0)][DBLP]
    IPCO, 1995, pp:414-425 [Conf]
  7. András Frank, Tibor Jordán, Zoltán Szigeti
    An Orientation Theorem with Parity Conditions. [Citation Graph (0, 0)][DBLP]
    IPCO, 1999, pp:183-190 [Conf]
  8. András Frank, Tamás Király
    Combined Connectivity Augmentation and Orientation Problems. [Citation Graph (0, 0)][DBLP]
    IPCO, 2001, pp:130-144 [Conf]
  9. András Frank, Zoltán Király
    Parity Constrained k-Edge-Connected Orientations. [Citation Graph (0, 0)][DBLP]
    IPCO, 1999, pp:191-201 [Conf]
  10. András Frank, Alexander V. Karzanov, András Sebö
    On Multiflow Problems. [Citation Graph (0, 0)][DBLP]
    IPCO, 1992, pp:85-101 [Conf]
  11. András Frank, László Szegö
    An Extension of a Theorem of Henneberg and Laman. [Citation Graph (0, 0)][DBLP]
    IPCO, 2001, pp:145-159 [Conf]
  12. András Frank, Toshihide Ibaraki, Hiroshi Nagamochi
    Two Arc Disjoint Paths in Eulerian Diagraphs. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1995, pp:92-101 [Conf]
  13. András Frank
    How to make a digraph strongly connected. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1981, v:1, n:2, pp:145-153 [Journal]
  14. András Frank
    Disjoint paths in a rectilinear grid. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1982, v:2, n:4, pp:361-371 [Journal]
  15. András Frank
    Packing paths in planar graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1990, v:10, n:4, pp:325-331 [Journal]
  16. András Frank
    Conservative weightings and ear-decompositions of graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1993, v:13, n:1, pp:65-81 [Journal]
  17. András Frank, Zoltán Király
    Graph Orientations with Edge-connection and Parity Constraints. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2002, v:22, n:1, pp:47-70 [Journal]
  18. András Frank, Éva Tardos
    An application of simultaneous Diophantine approximation in combinatorial optimization. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1987, v:7, n:1, pp:49-65 [Journal]
  19. Péter L. Erdös, András Frank, László A. Székely
    Minimum Multiway Cuts in Trees. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:87, n:1-3, pp:67-75 [Journal]
  20. András Frank
    Restricted t-matchings in bipartite graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:131, n:2, pp:337-346 [Journal]
  21. András Frank, Tibor Jordán, Zoltán Szigeti
    Combinatorial problems related to origin-destination matrices. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:115, n:1-3, pp:37-47 [Journal]
  22. András Frank, Tamás Király
    Combined connectivity augmentation and orientation problems. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:131, n:2, pp:401-419 [Journal]
  23. András Frank, Tamás Király, Matthias Kriesell
    On decomposing a hypergraph into k connected sub-hypergraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:131, n:2, pp:373-383 [Journal]
  24. András Frank, Tamás Király, Zoltán Király
    On the orientation of graphs and hypergraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:131, n:2, pp:385-400 [Journal]
  25. András Frank, Takao Nishizeki, Nobuji Saito, Hitoshi Suzuki
    Algorithms for Routing around a Rectangle. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1992, v:40, n:4, pp:363-378 [Journal]
  26. András Frank, László Szegö
    Constructive characterizations for packing and covering with trees. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:131, n:2, pp:347-371 [Journal]
  27. András Frank
    A Weighted Matroid Intersection Algorithm. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1981, v:2, n:4, pp:328-336 [Journal]
  28. Herbert Fleischner, András Frank
    On circuit decomposition of planar Eulerian graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1990, v:50, n:2, pp:245-253 [Journal]
  29. András Frank
    Finding feasible vectors of Edmonds-Giles polyhedra. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1984, v:36, n:3, pp:221-239 [Journal]
  30. András Frank
    Edge-disjoint paths in planar graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1985, v:39, n:2, pp:164-178 [Journal]
  31. András Frank
    Finding Minimum Generators of Path Systems'. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1999, v:75, n:2, pp:237-244 [Journal]
  32. András Frank, Tibor Jordán
    Minimal Edge-Coverings of Pairs of Sets. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1995, v:65, n:1, pp:73-110 [Journal]
  33. András Frank, Zoltán Szigeti
    On Packing T-Cuts. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1994, v:61, n:2, pp:263-271 [Journal]
  34. András Frank
    On chain and antichain families of a partially ordered set. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1980, v:29, n:2, pp:176-184 [Journal]
  35. András Frank
    On the orientation of graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1980, v:28, n:3, pp:251-261 [Journal]
  36. András Frank, Bruce Shepherd, Vivek Tandon, Zoltán Végh
    Node-Capacitated Ring Routing. [Citation Graph (0, 0)][DBLP]
    Math. Oper. Res., 2002, v:27, n:2, pp:372-383 [Journal]
  37. Mihály Bárász, Johanna Becker, András Frank
    An algorithm for source location in directed graphs. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2005, v:33, n:3, pp:221-230 [Journal]
  38. Tamás Fleiner, András Frank, Satoru Iwata
    A constrained independent set problem for matroids. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2004, v:32, n:1, pp:23-26 [Journal]
  39. Jørgen Bang-Jensen, András Frank, Bill Jackson
    Preserving and Increasing Local Edge-Connectivity in Mixed Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1995, v:8, n:2, pp:155-178 [Journal]
  40. András Frank
    Augmenting Graphs to Meet Edge-Connectivity Requirements. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1992, v:5, n:1, pp:25-53 [Journal]
  41. András Frank, Toshihide Ibaraki, Hiroshi Nagamochi
    Two Arc-Disjoint Paths in Eulerian Digraphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1998, v:11, n:4, pp:557-589 [Journal]
  42. András Frank, Alexander V. Karzanov, András Sebö
    On Integer Multiflow Maximization. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1997, v:10, n:1, pp:158-170 [Journal]
  43. András Frank
    A note on k-strongly connected orientations of an undirected graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1982, v:39, n:1, pp:103-104 [Journal]
  44. András Frank
    On a theorem of Mader. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:101, n:1-3, pp:49-57 [Journal]
  45. András Frank
    Submodular functions in graph theory. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:111, n:1-3, pp:231-243 [Journal]

  46. Rooted k-connections in digraphs. [Citation Graph (, )][DBLP]


  47. A note on degree-constrained subgraphs. [Citation Graph (, )][DBLP]


Search in 0.034secs, Finished in 0.036secs
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