Using Sifting for k -Layer Straightline Crossing Minimization

No abstract is available for this paper.

• Publication year

  1999

• Venue

  International Symposium Graph Drawing and Network Visualization

• Publication date

  1999-09-15

• Fields of study

  Computer Science, Engineering

• Identifiers
  DOI 10.1007/3-540-46648-7_22
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• AGD: A Library of Algorithms for Graph Drawing

  1998cited by this paper
• LEDA: a platform for combinatorial and geometric computing

  1997cited by this paper
• Drawing Graphs in Two Layers

  1994cited by this paper
• Dynamic variable ordering for ordered binary decision diagrams

  1993cited by this paper
• The Stanford GraphBase - a platform for combinatorial computing

  1993cited by this paper
• Experiments on drawing 2-level hierarchical graphs

  1990cited by this paper
• Crossing Number is NP-Complete

  1983cited by this paper
• Methods for Visual Understanding of Hierarchical System Structures

  1981cited by this paper
• Journal of Graph Algorithms and Applications 2-layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms

  year unknowncited by this paper

• Analysing the Effectiveness of Mutation Operators for One-Sided Bipartite Crossing Minimisation

  2025cites this paper
• Fast and Readable Layered Network Visualizations Using Large Neighborhood Search

  2025influential citation
• Sticky Links: Encoding Quantitative Data of Graph Edges

  2024cites this paper
• PACE Solver Description: Arcee

  2024cites this paper
• Arcee: An OCM-Solver

  2024cites this paper
• Evolutionary Algorithms for One-Sided Bipartite Crossing Minimisation

  2024cites this paper
• Evaluating and Extending Speedup Techniques for Optimal Crossing Minimization in Layered Graph Drawings

  2024cites this paper
• Vis Repligogy: Towards a Culture of Facilitating Replication Studies in Visualization Pedagogy and Research

  2024cites this paper
• A fast path relinking algorithm for the min-max edge crossing problem

  2024cites this paper
• Computing Hive Plots: A Combinatorial Framework

  2023influential citation
• Comparative Study and Evaluation of Hybrid Visualizations of Graphs

  2023cites this paper
• A variable depth neighborhood search algorithm for the Min-Max Arc Crossing Problem

  2021cites this paper
• A User Study on Hybrid Graph Visualizations

  2021cites this paper
• Tabu search for min-max edge crossing in graphs

  2020cites this paper
• Reduce Loss and Crosstalk in Integrated Silicon-Photonic Multistage Switching Fabrics Through Multichip Partition

  2020cites this paper
• Heuristics for the Constrained Incremental Graph Drawing Problem

  2019cites this paper
• Hybridizing simulated annealing with variable neighborhood search for bipartite graph crossing minimization

  2019cites this paper
• Logic learning and optimized drawing: two hard combinatorial problems

  2018cites this paper
• Heuristics for the min-max arc crossing problem in graphs

  2018cites this paper
• Stochastic Methods for One-Sided Bipartite Crossing Minimization and its Variants

  2016cites this paper
• Hierarchy-Aware Layer Sweep

  2016cites this paper
• 55 GRAPH DRAWING

  2016cites this paper
• On fast iterative mapping algorithms for stripe based coarse-grained reconfigurable architectures

  2015influential citation
• On Layered Drawings of Planar Graphs

  2014cites this paper
• UNTANGLED: A Game Environment for Discovery of Creative Mapping Strategies

  2013influential citation
• Drawings of Graphs

  2013cites this paper
• 13 Hierarchical Drawing Algorithms

  2013cites this paper
• Hierarchical Drawing Algorithms

  2013cites this paper
• Grid sifting: Leveling and crossing reduction

  2012cites this paper
• A heuristic for bottleneck crossing minimization and its performance on general crossing minimization: Hypothesis and experimental study

  2012cites this paper
• Combinatorial reasoning for sets, graphs and document composition

  2012cites this paper
• Heuristics for the Maximum 2-Layer RAC Subgraph Problem

  2012cites this paper
• Upward planarization and layout

  2011cites this paper
• k-Level Crossing Minimization Is NP-Hard for Trees

  2011cites this paper
• Sorting Heuristics for the Feedback Arc Set Problem ?

  2011cites this paper
• Solutions to decision-making problems in management engineering using molecular computational algorithms and experimentations

  2011cites this paper
• Efficient barycenter algorithm for drawing hierarchical graphs with minimum edge crossings

  2011cites this paper
• Layout Patterns with BPMN Semantics

  2011cites this paper
• Optimal k-Level Planarization and Crossing Minimization

  2010cites this paper
• A Global k-Level Crossing Reduction Algorithm

  2010cites this paper
• Bottleneck crossing minimization in layered graphs

  2010cites this paper
• Crossing minimization in extended level drawings of graphs

  2010cites this paper
• A new concentric-circle visualization of multi-dimensional data and its application in network security

  2010cites this paper
• Crossing Minimization in k-layer graphs

  2009cites this paper
• Group-Level Analysis and Visualization of Social Networks

  2009cites this paper
• Multi-dimensional Data Visualization using Concentric Coordinates

  2009cites this paper
• Sequential and parallel algorithms for low-crossing graph drawing

  2007cites this paper
• Multi-circular Layout of Micro/Macro Graphs

  2007cites this paper
• Data mining using the crossing minimization paradigm

  2007cites this paper
• A Radial Adaptation of the Sugiyama Framework for Visualizing Hierarchical Information

  2007cites this paper
• Crossing Reduction for Hierarchical Graphs with Intra-Level Edges

  2006cites this paper
• Crossing-constrained hierarchical drawings

  2006cites this paper
• Automating the Presentation of Computer Networks

  2006cites this paper
• Minimizing crossings in hierarchical digraphs with a hybridized genetic algorithm

  2006cites this paper
• A Radial Adaptation of the Sugiyama Framework for Hierarchical Graph Drawing

  2005cites this paper
• The Barycenter Heuristic and the Reorderable Matrix

  2005cites this paper
• Aesthetics and automatic layout of UML class diagrams

  2005cites this paper
• Crossings in clustered level graphs

  2005cites this paper
• Dissertation Crossings in Clustered Level Graphs

  2004cites this paper
• Crossing Reduction in Circular Layouts

  2004influential citation
• New Exact Results and Bounds for Bipartite Crossing Numbers of Meshes

  2004cites this paper
• Breaking Cycles for Minimizing Crossings 1

  2004cites this paper
• Orthogonal hypergraph routing for improved visibility

  2004cites this paper
• Analysis and Visualization of Social Networks

  2003cites this paper
• A Parallel Approach to Row-Based VLSI Layout Using Stochastic Hill-Climbing

  2003cites this paper
• Kantenkreuzungen in Kreislayouts

  2003influential citation
• Two New Heuristics for Two-Sided Bipartite Graph Drawing

  2002cites this paper
• Recursive bi-partitioning of netlists for large number of partitions

  2002cites this paper
• Crossing Reduction by Windows Optimization

  2002cites this paper
• Hierarchical Decompositions for Visualizing Large Graphs

  2002cites this paper
• Heuristics, Experimental Subjects, and Treatment Evaluation in Bigraph Crossing Minimization

  2001influential citation
• Removing Cycles for Minimizing Crossings

  2001cites this paper
• Exploratory Network Visualization: Simultaneous Display of Actor Status and Connections

  2001cites this paper
• One Sided Crossing Minimization Is NP-Hard for Sparse Graphs

  2001cites this paper
• Graph Drawing Algorithm Engineering with AGD

  2001cites this paper
• Online Hierarchical Graph Drawing

  2001cites this paper
• Drawing Graphs

  2001cites this paper
• Level assignment for displaying combinational logic

  2001cites this paper
• Contextual Visualization of Actor Status in Social Networks

  2000cites this paper
• k-Layer Straightline Crossing Minimization by Speeding Up Sifting

  2000influential citation
• Ptolomaeus: The Web Cartographer

  1998cites this paper
• AGD: A Library of Algorithms for Graph Drawing

  1998cites this paper
• Journal of Graph Algorithms and Applications Orthogonal Hypergraph Drawing for Improved Visibility

  year unknowncites this paper
• Journal of Graph Algorithms and Applications Multi-level Verticality Optimization: Concept, Strategies, and Drawing Scheme 330 M. Chimani and P. Hungerländer Multi-level Verticality Optimization

  year unknowncites this paper
• Journal of Graph Algorithms and Applications Global K-level Crossing Reduction

  year unknowncites this paper