On the public citation graph
Improved Optimal and Approximate Power Graph Compression for Clearer Visualisation of Dense Graphs
0 signed · 40 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/978-3-540-24595-7_1openalex-snapshot
Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way
inferredcites →https://doi.org/10.1007/978-3-642-36763-2_55openalex-snapshot
On the Faithfulness of Graph Visualizations
inferredcites →https://doi.org/10.1016/0196-6774(86)90020-9openalex-snapshot
The NP-completeness column: An ongoing guide
inferredcites →https://doi.org/10.1016/0196-6774(87)90021-6openalex-snapshot
The NP-completeness column: An ongoing guide
inferredcites →https://doi.org/10.1016/s0166-218x(03)00333-0openalex-snapshot
The maximum edge biclique problem is NP-complete
inferredcites →https://doi.org/10.1017/s1446788700005954openalex-snapshot
An extremal problem in graph theory
inferredcites →https://doi.org/10.1073/pnas.0601602103openalex-snapshot
Modularity and community structure in networks
inferredcites →https://doi.org/10.1109/pacificvis.2011.5742390openalex-snapshot
An extended evaluation of the readability of tapered, animated, and textured directed-edge representations in node-link graphs
inferredcites →https://doi.org/10.1109/pacificvis.2013.6596147openalex-snapshot
On the faithfulness of graph visualizations
inferredcites →https://doi.org/10.1109/pacificvis.2014.46openalex-snapshot
Improved Optimal and Approximate Power Graph Compression for Clearer Visualisation of Dense Graphs
inferredcites →https://doi.org/10.1109/tvcg.2013.151openalex-snapshot
Edge Compression Techniques for Visualization of Dense Directed Graphs
inferredcites →https://doi.org/10.1111/j.1467-8659.2009.01450.xopenalex-snapshot
Force‐Directed Edge Bundling for Graph Visualization
inferredcites →https://doi.org/10.1137/0210022openalex-snapshot
Node-Deletion Problems on Bipartite Graphs
inferredcites →https://doi.org/10.1145/800133.804355openalex-snapshot
Node-and edge-deletion NP-complete problems
inferredcites →https://doi.org/10.1371/journal.pcbi.1000108openalex-snapshot
Unraveling Protein Networks with Power Graph Analysis
inferredcites →https://doi.org/10.1504/ijwet.2012.048520openalex-snapshot
Mining potential research synergies from co-authorship graphs using power graph analysis
inferredcites →https://doi.org/10.4064/cm-13-2-251-254openalex-snapshot
On an extremal problem in graph theory
inferredcites →https://doi.org/10.7155/jgaa.00099openalex-snapshot
Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-030-21462-3_18openalex-snapshot
Concept Lattices as a Search Space for Graph Compression
inferred← citeshttps://doi.org/10.1007/978-3-319-06793-3_10openalex-snapshot
Scalability Considerations for Multivariate Graph Visualization
inferred← citeshttps://doi.org/10.1007/978-3-319-21383-5_107openalex-snapshot
User Exploration of Search Space Using Tradeoffs
inferred← citeshttps://doi.org/10.1007/978-3-319-59271-8_6openalex-snapshot
FCA in a Logical Programming Setting for Visualization-Oriented Graph Compression
inferred← citeshttps://doi.org/10.1016/j.jvlc.2017.09.004openalex-snapshot
Convergent drawing for mutually connected directed graphs
inferred← citeshttps://doi.org/10.1016/j.visinf.2020.11.001openalex-snapshot
The Data Visualisation and Immersive Analytics Research Lab at Monash University
inferred← citeshttps://doi.org/10.1109/sibgrapi.2017.22openalex-snapshot
A Hierarchical Network Simplification via Non-Negative Matrix Factorization
inferred← citeshttps://doi.org/10.1109/sibgrapi.2018.00051openalex-snapshot
Graph Spectral Filtering for Network Simplification
inferred← citeshttps://doi.org/10.1109/tbdata.2023.3262151openalex-snapshot
Application of Mathematical Optimization in Data Visualization and Visual Analytics: A Survey
inferred← citeshttps://doi.org/10.1109/tvcg.2015.2467251openalex-snapshot
High-Quality Ultra-Compact Grid Layout of Grouped Networks
inferred← citeshttps://doi.org/10.1109/tvcg.2016.2598545openalex-snapshot
What do Constraint Programming Users Want to See? Exploring the Role of Visualisation in Profiling of Models and Search
inferred← citeshttps://doi.org/10.1109/tvcg.2016.2598958openalex-snapshot
Towards Unambiguous Edge Bundling: Investigating Confluent Drawings for Network Visualization
inferred← citeshttps://doi.org/10.1109/tvcg.2019.2944619openalex-snapshot
Further Towards Unambiguous Edge Bundling: Investigating Power-Confluent Drawings for Network Visualization
inferred← citeshttps://doi.org/10.1111/cgf.13213openalex-snapshot
State of the Art in Edge and Trail Bundling Techniques
inferred← citeshttps://doi.org/10.1111/cgf.13391openalex-snapshot
VisFM: Visual Analysis of Image Feature Matchings
inferred← citeshttps://doi.org/10.1111/cgf.70433openalex-snapshot
Noisy Graph Patterns via Ordered Matrices
inferred← citeshttps://doi.org/10.11606/t.55.2017.tde-11052017-105059openalex-snapshot
Generation of semantic layouts for interactive multidimensional data visualization
inferred← citeshttps://doi.org/10.11606/t.55.2019.tde-02012019-111037openalex-snapshot
Simplificação e análise de redes com dados multivariados
inferred← citeshttps://doi.org/10.70675/d22de006ze7a5z4f91z9d05z2964a74df2b3openalex-snapshot
Bundling : a clutter reduction technique and its application to Alzheimer study
showing the first 20 of 21 · page through all 21
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.