Pages that link to "Item:Q2701745"

The following pages link to Journal of Graph Algorithms and Applications (Q2701745):

Displaying 50 items.

• Clustering in Trees: Optimizing Cluster Sizes and Number of Subtrees (Q2701746) (← links)
• Planarizing Graphs - A Survey and Annotated Bibliography (Q2701748) (← links)
• Fully Dynamic 3-Dimensional Orthogonal Graph Drawing (Q2701749) (← links)
• 1-Bend 3-D Orthogonal Box-Drawings: Two Open Problems Solved (Q2724198) (← links)
• Carrying Umbrellas: an Online Relocation Game on a Graph (Q2755056) (← links)
• New Bounds for Oblivious Mesh Routing (Q2755057) (← links)
• Finding All the Best Swaps of a Minimum Diameter Spanning Tree Under Transient Edge Failures (Q2755058) (← links)
• Shelling Hexahedral Complexes for Mesh Generation (Q2755059) (← links)
• Connectivity of Planar Graphs (Q2755060) (← links)
• Computing an Optimal Orientation of a Balanced Decomposition Tree for Linear Arrangement Problems (Q2755062) (← links)
• Dichotomy Theorems for Homomorphism Polynomials of Graph Classes (Q2790150) (← links)
• An Improved Algorithm for Parameterized Edge Dominating Set Problem (Q2790152) (← links)
• An Efficient Silent Self-Stabilizing 1-Maximal Matching Algorithm in Anonymous Networks (Q2790154) (← links)
• The Impact of Communication Patterns on Distributed Self-Adjusting Binary Search Tree (Q2790155) (← links)
• Common Unfolding of Regular Tetrahedron and Johnson-Zalgaller Solid (Q2790157) (← links)
• Threshold Circuits Detecting Global Patterns in Two-dimensional Maps (Q2790159) (← links)
• Simultaneous Drawing of Planar Graphs with Right-Angle Crossings and Few Bends (Q2790160) (← links)
• Constructive algorithms for the partial directed weighted improper coloring problem (Q2790161) (← links)
• Phylogenetic incongruence through the lens of Monadic Second Order logic (Q2790162) (← links)
• Algorithms and Bounds for Overloaded Orthogonal Drawings (Q2790163) (← links)
• A navigation system for tree space (Q2800964) (← links)
• The Unit Bar Visibility Number of a Graph (Q2800967) (← links)
• Lower Bounds for Graph Exploration Using Local Policies (Q2803810) (← links)
• Minimum Eccentricity Shortest Paths in some Structured Graph Classes (Q2807326) (← links)
• A Binomial Distribution Model for the Traveling Salesman Problem Based on Frequency Quadrilaterals (Q2819862) (← links)
• Graph Layout with Versatile Boundary Constraints (Q2819863) (← links)
• On the Complexity of Partitioning Graphs for Arc-Flags (Q2838234) (← links)
• A Note on Minimum-Segment Drawings of Planar Graphs (Q2838235) (← links)
• Multi-level Verticality Optimization: Concept, Strategies, and Drawing Scheme (Q2842197) (← links)
• Toward a Theory of Planarity: Hanani-Tutte and Planarity Variants (Q2842198) (← links)
• Edge-weighted contact representations of planar graphs (Q2842200) (← links)
• Planar Graphs as VPG-Graphs (Q2842201) (← links)
• Graph Drawing in TikZ (Q2842202) (← links)
• Interactive Visualization of Streaming Text Data with Dynamic Maps (Q2842204) (← links)
• Optical Graph Recognition (Q2842205) (← links)
• An Approximate Restatement of the Four-Color Theorem (Q2856478) (← links)
• Smooth Orthogonal Layouts (Q2856479) (← links)
• On Alliance Partitions and Bisection Width for Planar Graphs (Q2865020) (← links)
• An FPT algorithm for Tree Deletion Set (Q2865021) (← links)
• Box-Rectangular Drawings of Planar Graphs (Q2865022) (← links)
• Smoothed Analysis of Belief Propagation for Minimum-Cost Flow and Matching (Q2865023) (← links)
• Lower bounds for Ramsey numbers for complete bipartite and 3-uniform tripartite subgraphs (Q2865025) (← links)
• Recognition of Unigraphs through Superposition of Graphs (Q2865028) (← links)
• Crossing-Optimal Acyclic HP-Completion for Outerplanar st-Digraphs (Q2865031) (← links)
• Recursive generation of simple planar 5-regular graphs and pentangulations (Q2865033) (← links)
• Straight-Line Grid Drawings of Label-Constrained Outerplanar Graphs with O(n log n) Area (Q2865034) (← links)
• Generating All Triangulations of Plane Graphs (Q2865036) (← links)
• The Voronoi game on graphs and its complexity (Q2865040) (← links)
• Optimal Angular Resolution for Face-Symmetric Drawings (Q2865043) (← links)
• Constant-Work-Space Algorithms for Shortest Paths in Trees and Simple Polygons (Q2865044) (← links)