default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFrank M. Johannes
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2008
[j6]Peter Spindler, Ulf Schlichtmann
, Frank M. Johannes:
Kraftwerk2 - A Fast Force-Directed Quadratic Placement Approach Using an Accurate Net Model. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 27(8): 1398-1411 (2008)- [c24]Martin Strasser, Michael Eick, Helmut Gräb, Ulf Schlichtmann, Frank M. Johannes:
Deterministic analog circuit placement using hierarchically bounded enumeration and enhanced shape functions. ICCAD 2008: 306-313 - [c23]Peter Spindler, Ulf Schlichtmann, Frank M. Johannes:
Abacus: fast legalization of standard cell circuits with minimal movement. ISPD 2008: 47-53 - 2007
- [c22]Peter Spindler, Frank M. Johannes:
Fast and accurate routing demand estimation for efficient routability-driven placement. DATE 2007: 1226-1231 - [p1]Peter Spindler, Frank M. Johannes:
Kraftwerk: A Fast and Robust Quadratic Placer Using an Exact Linear Net Model. Modern Circuit Placement 2007: 59-93 - 2006
- [c21]Peter Spindler, Frank M. Johannes:
Fast and robust quadratic placement combined with an exact linear net model. ICCAD 2006: 179-186 - 2005
- [c20]Bernd Obermeier, Hans Ranke, Frank M. Johannes:
Kraftwerk: a versatile placement approach. ISPD 2005: 242-244 - 2004
- [c19]Bernd Obermeier, Frank M. Johannes:
Temperature-aware global placement. ASP-DAC 2004: 143-148 - [c18]Bernd Obermeier, Frank M. Johannes:
Quadratic placement using an improved timing model. DAC 2004: 705-710 - 2003
- [c17]Ulrich Seidl, Klaus Eckl, Frank M. Johannes:
Performance-Directed Retiming for FPGAs Using Post-Placement Delay Information. DATE 2003: 10770-10777 - 2000
- [j5]Guenter Stenz, Bernhard M. Riess, Bernhard Rohfleisch, Frank M. Johannes:
Performance optimization by interacting netlist transformations andplacement. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 19(3): 350-358 (2000)
1990 – 1999
- 1998
- [c16]Hans Eisenmann, Frank M. Johannes:
Generic Global Placement and Floorplanning. DAC 1998: 269-274 - [c15]Aiguo Lu, Guenter Stenz, Frank M. Johannes:
Technology Mapping for Minimizing Gate and Routing Area. DATE 1998: 664-669 - [c14]Aiguo Lu, Hans Eisenmann, Guenter Stenz, Frank M. Johannes:
Combining technology mapping with post-placement resynthesis for performance optimization. ICCD 1998: 616-621 - 1997
- [c13]Guenter Stenz, Bernhard M. Riess, Bernhard Rohfleisch, Frank M. Johannes:
Timing driven placement in interaction with netlist transformations. ISPD 1997: 36-41 - 1996
- [c12]Frank M. Johannes:
Partitioning of VLSI Circuits and Systems. DAC 1996: 83-87 - [c11]Tobias H. Abthoff, Frank M. Johannes:
TINA: analog placement using enumerative techniques capable of optimizing both area and net length. EURO-DAC 1996: 398-403 - 1995
- [j4]Tobias H. Abthoff, Frank M. Johannes:
Analogue placement using guided enumeration. Int. J. Circuit Theory Appl. 23(4): 453-472 (1995) - 1994
- [j3]Konrad Doll, Frank M. Johannes, Kurt Antreich:
Iterative placement improvement by network flow methods. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 13(10): 1189-1200 (1994) - [c10]Bernhard M. Riess, Konrad Doll, Frank M. Johannes:
Partitioning Very Large Circuits Using Analytical Placement Techniques. DAC 1994: 646-651 - [c9]Henning Spruth, Frank M. Johannes:
Parallel Routing of VLSI Circuits Based on Net Independency. IPPS 1994: 949-953 - [c8]Henning Spruth, Frank M. Johannes, Kurt Antreich:
PHIroute: A Parallel Hierarchical Sea-of-Gates Router. ISCAS 1994: 487-490 - 1993
- [c7]Henning Spruth, Frank M. Johannes:
Architectures for Parallel Slicing Enumeration in VLSI Layout. Parallel Computer Architectures 1993: 219-233 - 1992
- [j2]Karl-Heinz Erhard, Frank M. Johannes:
Power/ground networks in VLSI: are general graphs better than trees? Integr. 14(1): 91-109 (1992) - [c6]Konrad Doll, Frank M. Johannes, Georg Sigl:
Accurate net models for placement improvement by network flow methods. ICCAD 1992: 594-597 - 1991
- [j1]Jürgen M. Kleinhans, Georg Sigl, Frank M. Johannes, Kurt Antreich:
GORDIAN: VLSI placement by quadratic programming and slicing optimization. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 10(3): 356-365 (1991) - [c5]Georg Sigl, Konrad Doll, Frank M. Johannes:
Analytical Placement: A Linear or a Quadratic Objective Function? DAC 1991: 427-432 - [c4]Konrad Doll, Frank M. Johannes, Georg Sigl:
DOMINO: Deterministic Placement Improvement with Hill-Climbing Capabilities. VLSI 1991: 91-100 - [c3]Karl-Heinz Erhard, Frank M. Johannes:
Area Minimisation of IC Power/Ground Nets by Topology Optimisation. VLSI 1991: 119-126
1980 – 1989
- 1988
- [c2]Jürgen M. Kleinhans, Georg Sigl, Frank M. Johannes:
GORDIAN: a new global optimization/rectangle dissection method for cell placement. ICCAD 1988: 506-509 - 1986
- [c1]Knut M. Just, Jürgen M. Kleinhans, Frank M. Johannes:
On the relative placement and the transportation problem for standard-cell layout. DAC 1986: 308-313
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:05 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
