Seok-Hee Hong

From MaRDI portal
Person:243614

Available identifiers

zbMath Open hong.seok-heeDBLPh/SeokHeeHongWikidataQ108076344 ScholiaQ108076344MaRDI QIDQ243614

List of research outcomes





PublicationDate of PublicationType
New seeding strategies for the influence maximization problem2024-10-18Paper
Min-\(k\)-planar drawings of graphs2024-10-08Paper
Min-\(k\)-planar drawings of graphs2024-06-21Paper
Nonplanar Graph Drawings with k Vertices per Face2024-05-03Paper
Drawing Simultaneously Embedded Graphs with Few Bends2023-11-16Paper
Shape-faithful graph drawings2023-08-16Paper
Packing trees into 1-planar graphs2022-06-28Paper
New Quality Metrics for Dynamic Graph Drawing2021-12-01Paper
Re-embedding a 1-plane graph for a straight-line drawing in linear time2021-10-21Paper
Algorithms for 1-Planar Graphs2021-07-22Paper
Beyond planar graphs: introduction2021-07-22Paper
Path-monotonic upward drawings of graphs2021-04-21Paper
Multi-level graph drawing using infomap clustering2020-10-26Paper
A quality metric for visualization of clusters in graphs2020-10-26Paper
Colored anchored visibility representations in 2D and 3D space2020-10-23Paper
Packing trees into 1-planar graphs2020-07-22Paper
Packing Trees into 1-planar Graphs2019-11-05Paper
A linear-time algorithm for testing full outer-2-planarity2019-02-20Paper
Gap-Planar Graphs2019-02-20Paper
Turning cliques into paths to achieve planarity2019-02-15Paper
Gap-planar graphs2018-09-24Paper
https://portal.mardi4nfdi.de/entity/Q46438732018-05-29Paper
Simpler algorithms for testing two-page book embedding of partitioned graphs2018-05-15Paper
On the recognition of fan-planar and maximal outer-fan-planar graphs2017-10-10Paper
Re-embedding a 1-Plane Graph into a Straight-Line Drawing in Linear Time2017-02-21Paper
Testing Full Outer-2-planarity in Linear Time2016-10-21Paper
Circular right-angle crossing drawings in linear time2016-06-30Paper
Resolving data conflicts with multiple versions and precedence relationships in real-time databases2016-06-01Paper
On the edge crossing properties of Euclidean minimum weight Laman graphs2016-01-18Paper
Many-to-one boundary labeling with backbones2016-01-07Paper
Straight-Line Drawability of a Planar Graph Plus an Edge2015-10-30Paper
A linear-time algorithm for testing outer-1-planarity2015-09-02Paper
On the recognition of fan-planar and maximal outer-fan-planar graphs2015-01-07Paper
Anchored drawings of planar graphs2015-01-07Paper
Drawing simultaneously embedded graphs with few bends2015-01-07Paper
Simpler algorithms for testing two-page book embedding of partitioned graphs2014-09-26Paper
Order-preserving matching2014-03-13Paper
On the edge crossing properties of Euclidean minimum weight Laman graphs2014-01-14Paper
A linear time algorithm for testing maximal 1-planarity of graphs with a rotation system2014-01-13Paper
A linear-time algorithm for testing outer-1-planarity2013-12-20Paper
Many-to-one boundary labeling with backbones2013-12-20Paper
Testing maximal 1-planarity of graphs with a rotation system in linear time (extended abstract)2013-04-03Paper
Large angle crossing drawings of planar graphs in subquadratic area2013-01-07Paper
Fáry's theorem for 1-planar graphs2012-09-25Paper
Minimum cost star-shaped drawings of plane graphs with a fixed embedding and concave corner constraints2012-08-10Paper
A linear-time algorithm for star-shaped drawings of planar graphs with the minimum number of concave corners2012-04-26Paper
Bounds on the crossing resolution of complete geometric graphs2012-03-19Paper
Kozo Sugiyama 1945--20112012-03-09Paper
Extending Steinitz's theorem to upward star-shaped polyhedra and spherical polyhedra2011-12-14Paper
Colored simultaneous geometric embeddings and universal pointsets2011-06-30Paper
A linear-time algorithm for symmetric convex drawings of internally triconnected plane graphs2010-09-16Paper
Approximation algorithms for minimizing edge crossings in radial drawings2010-09-16Paper
Convex drawings of hierarchical planar graphs and clustered planar graphs2010-08-18Paper
Matched drawability of graph pairs and of graph triples2010-07-28Paper
Crossing minimization in extended level drawings of graphs2010-05-05Paper
On Rectilinear Drawing of Graphs2010-04-27Paper
Semi-bipartite graph visualization for gene ontology networks2010-04-27Paper
Upward star-shaped polyhedral graphs2009-12-17Paper
Bipartite Graph Representation of Multiple Decision Table Classifiers2009-11-19Paper
An algorithm for constructing star-shaped drawings of plane graphs2009-11-16Paper
New Approximation to the One-sided Radial Crossing Minimization2009-10-21Paper
Algorithms and Computation2009-08-07Paper
Testing planarity of geometric automorphisms in linear time2009-05-13Paper
Removing Node Overlaps Using Multi-sphere Scheme2009-03-03Paper
Generalizing the Shift Method for Rectangular Shaped Vertices with Visibility Constraints2009-03-03Paper
Matched Drawability of Graph Pairs and of Graph Triples2009-02-24Paper
A 2.5D Hierarchical Drawing of Directed Graphs2009-01-19Paper
Convex drawings of graphs with non-convex boundary constraints2008-09-29Paper
Convex Drawings of Graphs with Non-convex Boundary2008-09-04Paper
Star-Shaped Drawings of Graphs with Fixed Embedding and Concave Corner Constraints2008-07-10Paper
Approximating Crossing Minimization in Radial Layouts2008-04-15Paper
Geometric automorphism groups of graphs2007-10-29Paper
Graph Drawing2006-11-13Paper
Graph Drawing2006-11-13Paper
Graph Drawing2006-11-13Paper
Graph Drawing2006-11-13Paper
A linear time algorithm for constructing maximally symmetric straight line drawings of triconnected planar graphs2006-10-04Paper
Drawing planar graphs symmetrically. III: Oneconnected planar graphs2006-06-14Paper
Graph Drawing2005-12-07Paper
Graph Drawing2005-12-07Paper
Drawing planar graphs symmetrically. II: Biconnected planar graphs2005-08-02Paper
Crossing minimization for symmetries2005-06-14Paper
https://portal.mardi4nfdi.de/entity/Q48289542004-11-29Paper
Linkless symmetric drawings of series parallel digraphs2004-11-18Paper
https://portal.mardi4nfdi.de/entity/Q30437162004-08-06Paper
https://portal.mardi4nfdi.de/entity/Q44724992004-08-04Paper
https://portal.mardi4nfdi.de/entity/Q44723252004-08-04Paper
https://portal.mardi4nfdi.de/entity/Q44278772003-09-14Paper
https://portal.mardi4nfdi.de/entity/Q44222652003-09-03Paper
Drawing trees symmetrically in three dimensions2003-08-17Paper
Drawing series parallel digraphs symmetrically2001-06-21Paper
https://portal.mardi4nfdi.de/entity/Q42495321999-08-17Paper

Research outcomes over time

This page was built for person: Seok-Hee Hong