The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Franz-Josef Brandenburg: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Franz-Josef Brandenburg
    Der Einfluß von Kontext auf spezielle CF-Grammatiken. [Citation Graph (0, 0)][DBLP]
    Automatentheorie und Formale Sprachen, 1973, pp:139-148 [Conf]
  2. Franz-Josef Brandenburg
    Homomorphic Representations of Certain Classes of Languages. [Citation Graph (0, 0)][DBLP]
    Advances in Algorithms, Languages, and Complexity, 1997, pp:93-110 [Conf]
  3. Therese C. Biedl, Franz-Josef Brandenburg
    Drawing planar bipartite graphs with small area. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:105-108 [Conf]
  4. Franz-Josef Brandenburg
    Analogies of PAL and COPY. [Citation Graph (0, 0)][DBLP]
    FCT, 1981, pp:61-70 [Conf]
  5. Franz-Josef Brandenburg, Michael Forster, Andreas Pick, Marcus Raitner, Falk Schreiber
    BioPath Visualization of Biochemical Pathways. [Citation Graph (0, 0)][DBLP]
    German Conference on Bioinformatics, 2001, pp:11-15 [Conf]
  6. Sabine Bachl, Franz-Josef Brandenburg
    Computing and Drawing Isomorphic Subgraphs. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2002, pp:74-85 [Conf]
  7. Christian Bachmaier, Franz-Josef Brandenburg, Michael Forster
    Radial Level Planarity Testing and Embedding in Linear Time. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2003, pp:393-405 [Conf]
  8. Christian Bachmaier, Franz-Josef Brandenburg, Michael Forster, Paul Holleis, Marcus Raitner
    Gravisto: Graph Visualization Toolkit. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2004, pp:502-503 [Conf]
  9. Franz-Josef Brandenburg
    Graph-Drawing Contest Report. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2002, pp:376-379 [Conf]
  10. Franz-Josef Brandenburg
    Designing Graph Drawings by Layout Graph Grammars. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1994, pp:416-427 [Conf]
  11. Franz-Josef Brandenburg
    Graph Clustering 1: Circles of Cliques. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1997, pp:158-168 [Conf]
  12. Franz-Josef Brandenburg, Ulrik Brandes, Peter Eades, Joe Marks
    Graph Drawing Contest Report. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2003, pp:504-508 [Conf]
  13. Franz-Josef Brandenburg, Ulrik Brandes, Michael Himsolt, Marcus Raitner
    Graph-Drawing Contest Report. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2000, pp:410-418 [Conf]
  14. Franz-Josef Brandenburg, Christian A. Duncan, Emden R. Gansner, Stephen G. Kobourov
    Graph-Drawing Contest Report. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2004, pp:512-516 [Conf]
  15. Franz-Josef Brandenburg, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Giuseppe Liotta, Petra Mutzel
    Selected Open Problems in Graph Drawing. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2003, pp:515-539 [Conf]
  16. Franz-Josef Brandenburg, Michael Forster, Andreas Pick, Marcus Raitner, Falk Schreiber
    BioPath. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2001, pp:455-456 [Conf]
  17. Franz-Josef Brandenburg, Michael Himsolt, Christoph Rohrer
    An Experimental Comparison of Force-Directed and Randomized Graph Drawing Algorithms. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1995, pp:76-87 [Conf]
  18. Franz-Josef Brandenburg, Michael Jünger, Joe Marks, Petra Mutzel, Falk Schreiber
    Graph-Drawing Contest Report. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1999, pp:400-409 [Conf]
  19. Therese C. Biedl, Franz-Josef Brandenburg
    Graph-Drawing Contest Report. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2001, pp:513-522 [Conf]
  20. Therese C. Biedl, Franz-Josef Brandenburg, Xiaotie Deng
    Crossings and Permutations. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2005, pp:1-12 [Conf]
  21. Jubin Edachery, Arunabha Sen, Franz-Josef Brandenburg
    Graph Clustering Using Distance-k Cliques. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1999, pp:98-106 [Conf]
  22. Paul Holleis, Franz-Josef Brandenburg
    QUOGGLES: Query On Graphs - A Graphical Largely Extensible System. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2004, pp:465-470 [Conf]
  23. Therese C. Biedl, Franz-Josef Brandenburg
    Partitions of Graphs into Trees. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2006, pp:430-439 [Conf]
  24. Franz-Josef Brandenburg
    On Partially Ordered Graph Grammars. [Citation Graph (0, 0)][DBLP]
    Graph-Grammars and Their Application to Computer Science, 1986, pp:99-111 [Conf]
  25. Franz-Josef Brandenburg
    Layout Graph Grammars: The Placement Approach. [Citation Graph (0, 0)][DBLP]
    Graph-Grammars and Their Application to Computer Science, 1990, pp:144-156 [Conf]
  26. Franz-Josef Brandenburg, Michal Chytil
    Cycle Chain Code Picture Languages. [Citation Graph (0, 0)][DBLP]
    Graph-Grammars and Their Application to Computer Science, 1990, pp:157-173 [Conf]
  27. Franz-Josef Brandenburg, Michael Jünger, Petra Mutzel, Thomas Lengauer
    Algorithmen zum automatischen Zeichnen von Graphen im Rahmen des DFG-Schwerpunkts Effiziente Algorithmen für diskrete Probleme und ihre Anwendungen. [Citation Graph (0, 0)][DBLP]
    GI Jahrestagung, 1997, pp:58-67 [Conf]
  28. Ronald V. Book, Franz-Josef Brandenburg
    Representing Complexity Classes by Equality Sets (Preliminary Report). [Citation Graph (0, 0)][DBLP]
    ICALP, 1979, pp:49-57 [Conf]
  29. Franz-Josef Brandenburg
    The Contextsensitivity Bounds of Contextsensitive Grammars and Languages. [Citation Graph (0, 0)][DBLP]
    ICALP, 1977, pp:120-134 [Conf]
  30. Franz-Josef Brandenburg
    Extended Chomsky-Schützenberger Theorems. [Citation Graph (0, 0)][DBLP]
    ICALP, 1982, pp:83-93 [Conf]
  31. Franz-Josef Brandenburg
    Intersections of Some Families of Languages. [Citation Graph (0, 0)][DBLP]
    ICALP, 1986, pp:60-68 [Conf]
  32. Franz-Josef Brandenburg
    Nice drawings of graphs are computationally hard. [Citation Graph (0, 0)][DBLP]
    Informatics and Psychology Workshop, 1988, pp:1-15 [Conf]
  33. Franz-Josef Brandenburg
    On the Tranformation of Derivation Graphs to Derivation Trees (Preliminary Report). [Citation Graph (0, 0)][DBLP]
    MFCS, 1981, pp:224-233 [Conf]
  34. Franz-Josef Brandenburg
    A Truely Morphic Characterization of Recursively Enumerable Sets. [Citation Graph (0, 0)][DBLP]
    MFCS, 1984, pp:205-213 [Conf]
  35. Franz-Josef Brandenburg
    The Equivalence of Boundary and Confluent Graph Grammars on Graph Languages of Bounded Degree. [Citation Graph (0, 0)][DBLP]
    RTA, 1991, pp:312-322 [Conf]
  36. Franz-Josef Brandenburg, Stephanie Herrmann
    Graph Searching and Search Time. [Citation Graph (0, 0)][DBLP]
    SOFSEM, 2006, pp:197-206 [Conf]
  37. Franz-Josef Brandenburg
    On Polynomial Time Graph Grammars. [Citation Graph (0, 0)][DBLP]
    STACS, 1988, pp:227-236 [Conf]
  38. Franz-Josef Brandenburg, Konstantin Skodinis
    Graph Automata for Linear Graph Languages. [Citation Graph (0, 0)][DBLP]
    TAGT, 1994, pp:336-350 [Conf]
  39. Franz-Josef Brandenburg
    On one-way auxiliary pushdown automata. [Citation Graph (0, 0)][DBLP]
    Theoretical Computer Science, 1977, pp:132-144 [Conf]
  40. Franz-Josef Brandenburg
    On the Height of Syntactical Graphs. [Citation Graph (0, 0)][DBLP]
    Theoretical Computer Science, 1981, pp:13-21 [Conf]
  41. Franz-Josef Brandenburg
    The computational complexity of certain graph grammars. [Citation Graph (0, 0)][DBLP]
    Theoretical Computer Science, 1983, pp:91-99 [Conf]
  42. Franz-Josef Brandenburg
    Cycles in Generalized Networks. [Citation Graph (0, 0)][DBLP]
    WG, 2002, pp:47-56 [Conf]
  43. Franz-Josef Brandenburg
    Erratum: Cycles in Generalized Networks. [Citation Graph (0, 0)][DBLP]
    WG, 2003, pp:383- [Conf]
  44. Franz-Josef Brandenburg
    On the Complexity of Optimal Drawings of Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 1989, pp:166-180 [Conf]
  45. Franz-Josef Brandenburg
    A Note on Generalized Parikh Equality Sets. [Citation Graph (0, 0)][DBLP]
    Elektronische Informationsverarbeitung und Kybernetik, 1982, v:18, n:10/11, pp:565-568 [Journal]
  46. Franz-Josef Brandenburg
    Unary Multiple Equality Sets: The Languages of Rational Matrices [Citation Graph (0, 0)][DBLP]
    Information and Control, 1981, v:50, n:3, pp:199-227 [Journal]
  47. Franz-Josef Brandenburg, Werner Freise, Winfried Görke, Reiner W. Hartenstein, P. Kühn, H. J. Schmitt
    Gemeinsame Stellungnahme der Fakultätentage Elektrotechnik und Informatik zur Abstimmung ihrer Fachgebierte im Bereich Informationstechnik. [Citation Graph (0, 0)][DBLP]
    Informatik Spektrum, 1991, v:14, n:3, pp:163-167 [Journal]
  48. Franz-Josef Brandenburg, Michael Jünger, Petra Mutzel
    Algorithmen zum automatischen Zeichnen von Graphen. [Citation Graph (0, 0)][DBLP]
    Informatik Spektrum, 1997, v:20, n:4, pp:199-207 [Journal]
  49. Michael Forster, Andreas Pick, Marcus Raitner, Falk Schreiber, Franz-Josef Brandenburg
    The system architecture of the BioPath system. [Citation Graph (0, 0)][DBLP]
    In Silico Biology, 2002, v:2, n:, pp:37- [Journal]
  50. Franz-Josef Brandenburg, Jürgen Dassow
    Efficient Reductions of Picture Words. [Citation Graph (0, 0)][DBLP]
    ITA, 1993, v:27, n:1, pp:49-56 [Journal]
  51. Franz-Josef Brandenburg
    Multiple Equality Sets and Post Machines. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1980, v:21, n:3, pp:292-316 [Journal]
  52. Sabine Bachl, Franz-Josef Brandenburg, Daniel Gmach
    Computing and Drawing Isomorphic Subgraphs. [Citation Graph (0, 0)][DBLP]
    J. Graph Algorithms Appl., 2004, v:8, n:2, pp:215-238 [Journal]
  53. Christian Bachmaier, Franz-Josef Brandenburg, Michael Forster
    Radial Level Planarity Testing and Embedding in Linear Time. [Citation Graph (0, 0)][DBLP]
    J. Graph Algorithms Appl., 2005, v:9, n:1, pp:53-97 [Journal]
  54. Franz-Josef Brandenburg
    Three Write Heads Are as Good as k. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1981, v:14, n:, pp:1-12 [Journal]
  55. Franz-Josef Brandenburg, Andreas Brandstädt, Klaus W. Wagner
    Uniform Simulations of Nondeterministic Real Time Multitape Turing Machines. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1987, v:19, n:4, pp:277-299 [Journal]
  56. Ronald V. Book, Franz-Josef Brandenburg
    Equality Sets and Complexity Classes. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1980, v:9, n:4, pp:729-743 [Journal]
  57. Franz-Josef Brandenburg
    Uniformly Growing k-TH Power-Free Homomorphisms. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1983, v:23, n:, pp:69-82 [Journal]
  58. Franz-Josef Brandenburg
    A Note on: `Deque Automata and a Subfamily of Context-Sensitive Languages which Contains All Semilinear Bounded Languages'. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1987, v:52, n:, pp:341-342 [Journal]
  59. Franz-Josef Brandenburg
    Representations of Language Families by Homomorphic Equality Operations and Generalized Equality Sets. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1987, v:55, n:2-3, pp:183-263 [Journal]
  60. Franz-Josef Brandenburg
    On the Intersection of Stacks and Queues. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1988, v:58, n:, pp:69-80 [Journal]
  61. Franz-Josef Brandenburg
    The Ancestor Width of Grammars and Languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:207, n:1, pp:25-41 [Journal]
  62. Franz-Josef Brandenburg, Konstantin Skodinis
    Finite graph automata for linear and boundary graph languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:332, n:1-3, pp:199-232 [Journal]

  63. Coordinate Assignment for Cyclic Level Graphs. [Citation Graph (, )][DBLP]


  64. Cyclic Leveling of Directed Graphs. [Citation Graph (, )][DBLP]


  65. Tree Drawings on the Hexagonal Grid. [Citation Graph (, )][DBLP]


  66. A Global k-Level Crossing Reduction Algorithm. [Citation Graph (, )][DBLP]


  67. Shortest Path and Maximum Flow Problems in Networks with Additive Losses and Gains. [Citation Graph (, )][DBLP]


  68. On the complexity of crossings in permutations. [Citation Graph (, )][DBLP]


Search in 0.015secs, Finished in 0.017secs
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