Vote for your favorite mineral in #MinCup25! - Paddlewheelite vs. Mannardite
It's a battle of the tiny as bright green #paddlewheelite goes up against jet black #mannardite. Both are small yet mighty minerals, but only one can win!
Log InRegister
Quick Links : The Mindat ManualThe Rock H. Currier Digital LibraryMindat Newsletter [Free Download]
Home PageAbout MindatThe Mindat ManualHistory of MindatCopyright StatusWho We AreContact UsAdvertise on Mindat
Donate to MindatCorporate SponsorshipSponsor a PageSponsored PagesMindat AdvertisersAdvertise on Mindat
Learning CenterWhat is a mineral?The most common minerals on earthInformation for EducatorsMindat ArticlesThe ElementsThe Rock H. Currier Digital LibraryGeologic Time
Minerals by PropertiesMinerals by ChemistryAdvanced Locality SearchRandom MineralRandom LocalitySearch by minIDLocalities Near MeSearch ArticlesSearch GlossaryMore Search Options
Search For:
Mineral Name:
Locality Name:
Keyword(s):
 
The Mindat ManualAdd a New PhotoRate PhotosLocality Edit ReportCoordinate Completion ReportAdd Glossary Item
Mining CompaniesStatisticsUsersMineral MuseumsClubs & OrganizationsMineral Shows & EventsThe Mindat DirectoryDevice SettingsThe Mineral Quiz
Photo SearchPhoto GalleriesSearch by ColorNew Photos TodayNew Photos YesterdayMembers' Photo GalleriesPast Photo of the Day GalleryPhotography

Di Battista, Giuseppe, Tamassia, Roberto (1988) Algorithms for plane representations of acyclic digraphs. Theoretical Computer Science, 61 (2). 175-198 doi:10.1016/0304-3975(88)90123-5

Advanced
   -   Only viewable:
Reference TypeJournal (article/letter/editorial)
TitleAlgorithms for plane representations of acyclic digraphs
JournalTheoretical Computer Science
AuthorsDi Battista, GiuseppeAuthor
Tamassia, RobertoAuthor
Year1988 (November)Volume61
Issue2
PublisherElsevier BV
DOIdoi:10.1016/0304-3975(88)90123-5Search in ResearchGate
Generate Citation Formats
Mindat Ref. ID6536636Long-form Identifiermindat:1:5:6536636:1
GUID0
Full ReferenceDi Battista, Giuseppe, Tamassia, Roberto (1988) Algorithms for plane representations of acyclic digraphs. Theoretical Computer Science, 61 (2). 175-198 doi:10.1016/0304-3975(88)90123-5
Plain TextDi Battista, Giuseppe, Tamassia, Roberto (1988) Algorithms for plane representations of acyclic digraphs. Theoretical Computer Science, 61 (2). 175-198 doi:10.1016/0304-3975(88)90123-5
In(1988) Theoretical Computer Science Vol. 61. Elsevier BV

See Also

These are possibly similar items as determined by title/reference text matching only.

Simon, Klaus (1988) An improved algorithm for transitive closure on acyclic digraphs. Theoretical Computer Science, 58 (1). 325-346 doi:10.1016/0304-3975(88)90032-1
Tamassia, Roberto, Tollis, Ioannis G. (1993) Dynamic reachability in planar digraphs with one source and one sink. Theoretical Computer Science, 119 (2). 331-343 doi:10.1016/0304-3975(93)90164-o
Cohen, Robert F., Di Battista, Giuseppe, Tamassia, Roberto, Tollis, Ioannis G. (1995) Dynamic Graph Drawings: Trees, Series-Parallel Digraphs, and Planar $ST$-Digraphs. SIAM Journal on Computing, 24 (5). 970-1001 doi:10.1137/s0097539792235724
(1988) Author index volume 61 (1988). Theoretical Computer Science, 61 (2). 321pp. doi:10.1016/0304-3975(88)90133-8
Bertolazzi, Paola, Di Battista, Giuseppe, Mannino, Carlo, Tamassia, Roberto (1998) Optimal Upward Planarity Testing of Single-Source Digraphs. SIAM Journal on Computing, 27 (1). 132-169 doi:10.1137/s0097539794279626
(1988) Editorial Board. Theoretical Computer Science, 61 (1). doi:10.1016/0304-3975(88)90102-8
Di Battista, Giuseppe, Tamassia, Roberto, Tollis, Ioannis G. (1992) Constrained visibility representations of graphs. Information Processing Letters, 41 (1) 1-7 doi:10.1016/0020-0190(92)90072-4
Belaga, Edward G. (1988) Bilinear mincing rank. Theoretical Computer Science, 61 (2). 299-306 doi:10.1016/0304-3975(88)90130-2
Staples, John (1988) Delaying unification algorithms for lambda calculi. Theoretical Computer Science, 56 (3). 277-288 doi:10.1016/0304-3975(88)90135-1
King, K.N. (1988) Alternating multihead finite automata. Theoretical Computer Science, 61 (2). 149-174 doi:10.1016/0304-3975(88)90122-3
Kennaway, Richard (1988) On “on graph rewritings”. Theoretical Computer Science, 61 (2). 317-320 doi:10.1016/0304-3975(88)90132-6
 
and/or  
Mindat.org is an outreach project of the Hudson Institute of Mineralogy, a 501(c)(3) not-for-profit organization.
Copyright © mindat.org and the Hudson Institute of Mineralogy 1993-2025, except where stated. Most political location boundaries are © OpenStreetMap contributors. Mindat.org relies on the contributions of thousands of members and supporters. Founded in 2000 by Jolyon Ralph.
To cite: Ralph, J., Von Bargen, D., Martynov, P., Zhang, J., Que, X., Prabhu, A., Morrison, S. M., Li, W., Chen, W., & Ma, X. (2025). Mindat.org: The open access mineralogy database to accelerate data-intensive geoscience research. American Mineralogist, 110(6), 833–844. doi:10.2138/am-2024-9486.
Privacy Policy - Terms & Conditions - Contact Us / DMCA issues - Report a bug/vulnerability Current server date and time: September 16, 2025 04:19:07
Go to top of page