• Skip to content (access key 1)
  • Skip to search (access key 7)
FWF — Austrian Science Fund
  • Go to overview page Discover

    • Research Radar
      • Research Radar Archives 1974–1994
    • Discoveries
      • Emmanuelle Charpentier
      • Adrian Constantin
      • Monika Henzinger
      • Ferenc Krausz
      • Wolfgang Lutz
      • Walter Pohl
      • Christa Schleper
      • Elly Tanaka
      • Anton Zeilinger
    • Impact Stories
      • Verena Gassner
      • Wolfgang Lechner
      • Birgit Mitter
      • Oliver Spadiut
      • Georg Winter
    • scilog Magazine
    • Austrian Science Awards
      • FWF Wittgenstein Awards
      • FWF ASTRA Awards
      • FWF START Awards
      • Award Ceremony
    • excellent=austria
      • Clusters of Excellence
      • Emerging Fields
    • In the Spotlight
      • 40 Years of Erwin Schrödinger Fellowships
      • Quantum Austria
    • Dialogs and Talks
      • think.beyond Summit
    • Knowledge Transfer Events
    • E-Book Library
  • Go to overview page Funding

    • Portfolio
      • excellent=austria
        • Clusters of Excellence
        • Emerging Fields
      • Projects
        • Principal Investigator Projects
        • Principal Investigator Projects International
        • Clinical Research
        • 1000 Ideas
        • Arts-Based Research
        • FWF Wittgenstein Award
      • Careers
        • ESPRIT
        • FWF ASTRA Awards
        • Erwin Schrödinger
        • doc.funds
        • doc.funds.connect
      • Collaborations
        • Specialized Research Groups
        • Special Research Areas
        • Research Groups
        • International – Multilateral Initiatives
        • #ConnectingMinds
      • Communication
        • Top Citizen Science
        • Science Communication
        • Book Publications
        • Digital Publications
        • Open-Access Block Grant
      • Subject-Specific Funding
        • AI Mission Austria
        • Belmont Forum
        • ERA-NET HERA
        • ERA-NET NORFACE
        • ERA-NET QuantERA
        • Alternative Methods to Animal Testing
        • European Partnership BE READY
        • European Partnership Biodiversa+
        • European Partnership BrainHealth
        • European Partnership ERA4Health
        • European Partnership ERDERA
        • European Partnership EUPAHW
        • European Partnership FutureFoodS
        • European Partnership OHAMR
        • European Partnership PerMed
        • European Partnership Water4All
        • Gottfried and Vera Weiss Award
        • LUKE – Ukraine
        • netidee SCIENCE
        • Herzfelder Foundation Projects
        • Quantum Austria
        • Rückenwind Funding Bonus
        • WE&ME Award
        • Zero Emissions Award
      • International Collaborations
        • Belgium/Flanders
        • Germany
        • France
        • Italy/South Tyrol
        • Japan
        • Korea
        • Luxembourg
        • Poland
        • Switzerland
        • Slovenia
        • Taiwan
        • Tyrol-South Tyrol-Trentino
        • Czech Republic
        • Hungary
    • Step by Step
      • Find Funding
      • Submitting Your Application
      • International Peer Review
      • Funding Decisions
      • Carrying out Your Project
      • Closing Your Project
      • Further Information
        • Integrity and Ethics
        • Inclusion
        • Applying from Abroad
        • Personnel Costs
        • PROFI
        • Final Project Reports
        • Final Project Report Survey
    • FAQ
      • Project Phase PROFI
      • Project Phase Ad Personam
      • Expiring Programs
        • Elise Richter and Elise Richter PEEK
        • FWF START Awards
  • Go to overview page About Us

    • Mission Statement
    • FWF Video
    • Values
    • Facts and Figures
    • Annual Report
    • What We Do
      • Research Funding
        • Matching Funds Initiative
      • International Collaborations
      • Studies and Publications
      • Equal Opportunities and Diversity
        • Objectives and Principles
        • Measures
        • Creating Awareness of Bias in the Review Process
        • Terms and Definitions
        • Your Career in Cutting-Edge Research
      • Open Science
        • Open-Access Policy
          • Open-Access Policy for Peer-Reviewed Publications
          • Open-Access Policy for Peer-Reviewed Book Publications
          • Open-Access Policy for Research Data
        • Research Data Management
        • Citizen Science
        • Open Science Infrastructures
        • Open Science Funding
      • Evaluations and Quality Assurance
      • Academic Integrity
      • Science Communication
      • Philanthropy
      • Sustainability
    • History
    • Legal Basis
    • Organization
      • Executive Bodies
        • Executive Board
        • Supervisory Board
        • Assembly of Delegates
        • Scientific Board
        • Juries
      • FWF Office
    • Jobs at FWF
  • Go to overview page News

    • News
    • Press
      • Logos
    • Calendar
      • Post an Event
      • FWF Informational Events
    • Job Openings
      • Enter Job Opening
    • Newsletter
  • Discovering
    what
    matters.

    FWF-Newsletter Press-Newsletter Calendar-Newsletter Job-Newsletter scilog-Newsletter

    SOCIAL MEDIA

    • LinkedIn, external URL, opens in a new window
    • , external URL, opens in a new window
    • Facebook, external URL, opens in a new window
    • Instagram, external URL, opens in a new window
    • YouTube, external URL, opens in a new window

    SCILOG

    • Scilog — The science magazine of the Austrian Science Fund (FWF)
  • elane login, external URL, opens in a new window
  • Scilog external URL, opens in a new window
  • de Wechsle zu Deutsch

  

Human-Centered Algorithm Engineering

Human-Centered Algorithm Engineering

Martin Nöllenburg (ORCID: 0000-0003-0454-3937)
  • Grant DOI 10.55776/P31119
  • Funding program Principal Investigator Projects
  • Status ended
  • Start November 1, 2018
  • End April 30, 2023
  • Funding amount € 386,269
  • Project website

Disciplines

Computer Sciences (100%)

Keywords

    Algorithm Engineering, Graph Drawing, Computational Cartography, Human Factors, Geometric Algorithms, Visualization

Abstract Final report

The HumAlgo project aims to develop and establish an entirely new approach in algorithmics, a central research area of computer science. Algorithmics is an area of theoretical computer science that employs formal, mathematical methods to design and analyze algorithms, which form the core of all software that shapes todays digital world. One point of criticism that faced algorithm theory in the past is a lack of relevance to practice. The methodology of algorithm engineering is a means to counteract this criticism. Algorithm engineering complements formal design and analysis with implementation aspects of algorithms and their experimental evaluation. Yet, many complex tasks that ask for software-aided solutions, cannot be transformed without clear limitations into a formal, algorithmic model to be solved in the sense of the algorithm engineering method. Examples can be found in the areas of network visualization and cartography, where aesthetic and subjective criteria determine solution quality and where professional graphic designers usually create better solutions than traditional computer programs that lack human creativity and superior cognitive skills. Computational questions, where humans fail when faced with the amount of data and computers fail due to insufficient models, are at the core of this project. For these kinds of problems, we want to complement the algorithm engineering methodology by integrating human expertise and creativity into algorithmic solution processes. Our main hypothesis is that this allows to design interactive human-machine algorithms that lead to more efficient, higher quality and better comprehensible solutions for human (expert) users. To achieve this, we integrate human constraints and needs in addition to formal problem modeling from the very beginning of the algorithm design process and evaluate the resulting algorithms and their solutions together with domain experts and compared against fully automatic as well as against manual solutions. Using selected application problems as examples, our goal in this project is to obtain novel interactive algorithms that combine the computing power of computers with the creativity and experience of human experts. In addition, we want to use the knowledge gained from these examples to develop the theoretical foundations of this so-called human-centered algorithm engineering and thus establish a new methodology for a whole class of computational problems, whose successful solution asks for combining the skills of human and machine.

Efficient algorithms play a fundamental role in the wide range of intelligent systems and software applications driving our modern, digitalized world. While fully automated solutions are perfectly fine in many cases, there are also a lot of highly relevant applications, where humans must or should interact with computer systems to find high-quality solutions that best fit a certain demand. This is the case especially when there is not a unique and formally defined optimization goal, but rather a diverse mix of soft criteria that characterize solution quality in a less crisp way. The ultimate choice of a solution may then be up to human judgment and subjective preferences. This FWF stand-alone project "Human-centered Algorithm Engineering" targeted the study of the latter type of computational problems. The project team aimed for designing and engineering algorithms for interactive human-computer co-optimization. Our main research challenge was to efficiently and effectively combine the mathematical accuracy and computational power of formal algorithmics with the creative power of the human mind. In this project, we chose two important research areas to apply this new algorithmic paradigm: Network visualization and computational cartography. Both fields have in common that they study visual, geometric representations of complex data with an aim for high legibility and aesthetic appeal - two criteria that are difficult to quantify and that involve a lot of subjective human judgment by domain experts. In the results obtained in this project, we thoroughly investigated interactive algorithms from both a theoretical perspective and a practical algorithm engineering perspective. For the more theoretical considerations, we studied different dynamic optimization algorithms that can iteratively solve user-constrained computational problems by acting on hypothetical user input and taking into account the visual stability of a sequence of intermediate solutions. These algorithms are specifically aimed for consistent solution updates with faster computation times compared to re-computations from scratch. For the more practical questions, we implemented a variety of interactive algorithms and evaluated their performance both by quantitative simulation experiments and by human-subject studies. Our application topics ranged from biological network data visualization, to semantic word clouds in text visualization and from labeling map features to cartograms and schematic network maps. Overall, the project led to two successfully defended PhD theses and a collection of 39 peer-reviewed research papers presented in scientific journals and conferences.

Research institution(s)
  • Technische Universität Wien - 100%
International project participants
  • Holger Gohlke, Heinrich-Heine-Universität Düsseldorf - Germany
  • Benjamin Niedermann, Universität Bonn - Germany
  • Maxwell J. Roberts, University of Essex

Research Output

  • 213 Citations
  • 86 Publications
  • 3 Datasets & models
  • 1 Scientific Awards
  • 2 Fundings
Publications
  • 2023
    Title Improving readability of static, straight-line graph drawings: A first look at edge crossing resolution through iterative vertex splitting
    DOI 10.1016/j.cag.2023.09.010
    Type Journal Article
    Author Ehlers H
    Journal Computers & Graphics
  • 2023
    Title MySemCloud: Semantic-aware Word Cloud Editing
    DOI 10.48550/arxiv.2306.12759
    Type Other
    Author Huber M
    Link Publication
  • 2023
    Title MySemCloud: Semantic-aware Word Cloud Editing
    DOI 10.1109/pacificvis56936.2023.00024
    Type Conference Proceeding Abstract
    Author Huber M
    Pages 147-156
  • 2023
    Title Splitting Vertices in 2-Layer Graph Drawings.
    DOI 10.1109/mcg.2023.3264244
    Type Journal Article
    Author Ahmed R
    Journal IEEE computer graphics and applications
    Pages 24-35
  • 2023
    Title Splitting Plane Graphs to Outerplanarity
    DOI 10.48550/arxiv.2301.09440
    Type Preprint
    Author Gronemann M
    Link Publication
  • 2020
    Title Parameterized Algorithms for Queue Layouts
    DOI 10.48550/arxiv.2008.08288
    Type Preprint
    Author Bhore S
  • 2020
    Title A Survey on Transit Map Layout – from Design, Machine, and Human Perspectives
    DOI 10.1111/cgf.14030
    Type Journal Article
    Author Wu H
    Journal Computer Graphics Forum
    Pages 619-646
    Link Publication
  • 2023
    Title Splitting Plane Graphs toOuterplanarity; In: WALCOM: Algorithms and Computation - 17th International Conference and Workshops, WALCOM 2023, Hsinchu, Taiwan, March 22-24, 2023, Proceedings
    DOI 10.1007/978-3-031-27051-2_19
    Type Book Chapter
    Publisher Springer Nature Switzerland
  • 2023
    Title Planarizing Graphs andTheir Drawings byVertex Splitting; In: Graph Drawing and Network Visualization - 30th International Symposium, GD 2022, Tokyo, Japan, September 13-16, 2022, Revised Selected Papers
    DOI 10.1007/978-3-031-22203-0_17
    Type Book Chapter
    Publisher Springer International Publishing
  • 2023
    Title Crossing Minimization in Time Interval Storylines
    DOI 10.48550/arxiv.2302.14213
    Type Preprint
    Author Dobler A
    Link Publication
  • 2022
    Title An Algorithmic Study of Fully Dynamic Independent Sets for Map Labeling
    DOI 10.1145/3514240
    Type Journal Article
    Author Bhore S
    Journal ACM Journal of Experimental Algorithmics (JEA)
    Pages 1-36
    Link Publication
  • 2022
    Title Parameterized Algorithms for Queue Layouts
    DOI 10.7155/jgaa.00597
    Type Journal Article
    Author Bhore S
    Journal Journal of Graph Algorithms and Applications
    Pages 335-352
    Link Publication
  • 2022
    Title Shape-Guided Mixed Metro Map Layout
    DOI 10.48550/arxiv.2208.14261
    Type Preprint
    Author Batik T
  • 2024
    Title Splitting Plane Graphs to Outerplanarity
    DOI 10.7155/jgaa.v28i3.2970
    Type Journal Article
    Author Gronemann M
    Journal Journal of Graph Algorithms and Applications
  • 2024
    Title On 1-Bend Upward Point-Set Embeddings ofst-Digraphs; In: LATIN 2024: Theoretical Informatics - 16th Latin American Symposium, Puerto Varas, Chile, March 18-22, 2024, Proceedings, Part I
    DOI 10.1007/978-3-031-55598-5_1
    Type Book Chapter
    Publisher Springer Nature Switzerland
  • 2024
    Title The Complexity ofCluster Vertex Splitting andCompany; In: SOFSEM 2024: Theory and Practice of Computer Science - 49th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2024, Cochem, Germany, February 19-23, 2024, Proceedings
    DOI 10.1007/978-3-031-52113-3_16
    Type Book Chapter
    Publisher Springer Nature Switzerland
  • 2021
    Title Worbel: Aggregating point labels into word clouds
    Type Conference Proceeding Abstract
    Author Bhore
    Conference Advances in Geographic Information Systems (SIGSPATIAL 2021)
    Pages 256-267
    Link Publication
  • 2021
    Title Untangling circular drawings: Algorithms and complexity
    Type Conference Proceeding Abstract
    Author Bhore
    Conference Algorithms and Computation (ISAAC 2021)
    Pages 19:1-19:17
    Link Publication
  • 2021
    Title Disjoint box covering in a rectilinear polygon
    Type Other
    Author Bhore
    Pages 71:1-71:7
    Link Publication
  • 2021
    Title An Approximation Algorithm for Maximum Stable Matching with Ties and Constraints
    DOI 10.4230/lipics.isaac.2021.71
    Type Conference Proceeding Abstract
    Author Yokoi Y
    Conference LIPIcs, Volume 212, ISAAC 2021
    Pages 71:1 - 71:16
    Link Publication
  • 2021
    Title Untangling Circular Drawings: Algorithms and Complexity
    DOI 10.4230/lipics.isaac.2021.19
    Type Conference Proceeding Abstract
    Author Bhore S
    Conference LIPIcs, Volume 212, ISAAC 2021
    Pages 19:1 - 19:17
    Link Publication
  • 2020
    Title Route schematization with landmarks
    DOI 10.5311/josis.2020.21.589
    Type Journal Article
    Author Galvão M
    Journal Journal of Spatial Information Science
    Link Publication
  • 2019
    Title Guidelines for Experimental Algorithmics: A Case Study in Network Analysis
    DOI 10.3390/a12070127
    Type Journal Article
    Author Angriman E
    Journal Algorithms
    Pages 127
    Link Publication
  • 2019
    Title Additional file 1: Appendices of Metabopolis: scalable network layout for biological pathway diagrams in urban map style
    DOI 10.6084/m9.figshare.8002640
    Type Other
    Author Hsiang-Yun Wu
    Link Publication
  • 2019
    Title Additional file 1: Appendices of Metabopolis: scalable network layout for biological pathway diagrams in urban map style
    DOI 10.6084/m9.figshare.8002640.v1
    Type Other
    Author Hsiang-Yun Wu
    Link Publication
  • 2019
    Title Towards Data-Driven Multilinear Metro Maps
    DOI 10.48550/arxiv.1904.03039
    Type Preprint
    Author Nickel S
  • 2023
    Title Untangling circular drawings: Algorithms and complexity
    DOI 10.1016/j.comgeo.2022.101975
    Type Journal Article
    Author Bhore S
    Journal Computational Geometry
  • 2023
    Title Transitions in Dynamic Point Labeling
    DOI 10.4230/lipics.giscience.2023.2
    Type Conference Proceeding Abstract
    Author Depian T
    Conference LIPIcs, Volume 277, GIScience 2023
    Pages 2:1 - 2:19
    Link Publication
  • 2019
    Title Metabopolis: scalable network layout for biological pathway diagrams in urban map style
    DOI 10.1186/s12859-019-2779-4
    Type Journal Article
    Author Wu H
    Journal BMC Bioinformatics
    Pages 187
    Link Publication
  • 2019
    Title Stable Visual Summaries for Trajectory Collections
    DOI 10.48550/arxiv.1912.00719
    Type Preprint
    Author Wulms J
  • 2019
    Title Geometric Planar Networks on Bichromatic Points
    DOI 10.48550/arxiv.1911.08924
    Type Preprint
    Author Bandyapadhyay S
  • 2019
    Title Computing Stable Demers Cartograms
    DOI 10.1007/978-3-030-35802-0_4
    Type Book Chapter
    Author Nickel S
    Publisher Springer Nature
    Pages 46-60
  • 2019
    Title Parameterized Algorithms for Book Embedding Problems
    DOI 10.1007/978-3-030-35802-0_28
    Type Book Chapter
    Author Bhore S
    Publisher Springer Nature
    Pages 365-378
  • 2019
    Title Exploring Semi-Automatic Map Labeling
    DOI 10.1145/3347146.3359359
    Type Conference Proceeding Abstract
    Author Klute F
    Pages 13-22
    Link Publication
  • 2019
    Title Exploring Semi-Automatic Map Labeling
    DOI 10.48550/arxiv.1910.07799
    Type Preprint
    Author Klute F
  • 2022
    Title Transitions in Dynamic Map Labeling
    DOI 10.34726/3122
    Type Other
    Author Depian T
    Link Publication
  • 2022
    Title Compacting Squares: Input-Sensitive In-Place Reconfiguration of Sliding Squares
    DOI 10.34726/3466
    Type Other
    Author Akitaya H
    Link Publication
  • 2022
    Title Planarizing Graphs and their Drawings by Vertex Splitting
    DOI 10.34726/3828
    Type Other
    Author Nickel S
    Link Publication
  • 2022
    Title Minimum Link Fencing
    DOI 10.4230/lipics.isaac.2022.34
    Type Conference Proceeding Abstract
    Author Bhore S
    Conference LIPIcs, Volume 248, ISAAC 2022
    Pages 34:1 - 34:14
    Link Publication
  • 2022
    Title Turbocharging Heuristics for Weak Coloring Numbers
    DOI 10.4230/lipics.esa.2022.44
    Type Conference Proceeding Abstract
    Author Dobler A
    Conference LIPIcs, Volume 244, ESA 2022
    Pages 44:1 - 44:18
    Link Publication
  • 2022
    Title An algorithmic study of practical map labeling
    Type PhD Thesis
    Author Guangping Li
    Link Publication
  • 2022
    Title Shape-Guided Mixed Metro Map Layout
    DOI 10.1111/cgf.14695
    Type Journal Article
    Author Batik T
    Journal Computer Graphics Forum
    Pages 495-506
    Link Publication
  • 2022
    Title Multidimensional Manhattan Preferences
    DOI 10.1007/978-3-031-20624-5_17
    Type Book Chapter
    Author Chen J
    Publisher Springer Nature
    Pages 273-289
  • 2022
    Title Minimum link fencing
    Type Conference Proceeding Abstract
    Author Bhore
    Conference Algorithms and Computation (ISAAC 2022)
    Pages 34:1--34:14
    Link Publication
  • 2022
    Title Turbocharging Heuristics for Weak Coloring Numbers
    Type Conference Proceeding Abstract
    Author Dobler
    Conference European Symposium on Algorithms
    Pages 44:1--44:18
    Link Publication
  • 2023
    Title Engineering human-in-the-loop graph drawing algorithms: A study of vertex splitting and semantic word clouds
    Type PhD Thesis
    Author Anaïs Villedieu
    Link Publication
  • 2023
    Title Transitions in dynamic point labeling
    Type Conference Proceeding Abstract
    Author Depian
    Conference GIScience 2023
    Pages 2:1--2:19
    Link Publication
  • 2023
    Title Crossing minimization in time interval storylines
    Type Other
    Author D. Stojanovic
    Pages 36:1-36:7
    Link Publication
  • 2023
    Title Worbel: Aggregating Point Labels into Word Clouds
    DOI 10.1145/3603376
    Type Journal Article
    Author Bhore S
    Journal ACM Transactions on Spatial Algorithms and Systems
  • 2022
    Title Compacting Squares: Input-Sensitive In-Place Reconfiguration of Sliding Squares
    DOI 10.4230/lipics.swat.2022.4
    Type Conference Proceeding Abstract
    Author A. Akitaya H
    Conference LIPIcs, Volume 227, SWAT 2022
    Pages 4:1 - 4:19
    Link Publication
  • 2020
    Title Geometric Systems of Unbiased Representatives
    DOI 10.48550/arxiv.2002.05488
    Type Preprint
    Author Banik A
  • 2020
    Title An Algorithmic Study of Fully Dynamic Independent Sets for Map Labeling
    DOI 10.48550/arxiv.2002.07611
    Type Preprint
    Author Bhore S
  • 2020
    Title Parameterized Study of Steiner Tree on Unit Disk Graphs
    DOI 10.48550/arxiv.2004.09220
    Type Preprint
    Author Bhore S
  • 2020
    Title Parameterized Algorithms for Book Embedding Problems
    DOI 10.7155/jgaa.00526
    Type Journal Article
    Author Bhore S
    Journal Journal of Graph Algorithms and Applications
    Pages 603-620
    Link Publication
  • 2020
    Title An Algorithmic Study of Fully Dynamic Independent Sets for Map Labeling
    DOI 10.4230/lipics.esa.2020.19
    Type Conference Proceeding Abstract
    Author Bhore S
    Conference LIPIcs, Volume 173, ESA 2020
    Pages 19:1 - 19:24
    Link Publication
  • 2020
    Title Parameterized Study of Steiner Tree on Unit Disk Graphs
    DOI 10.4230/lipics.swat.2020.13
    Type Conference Proceeding Abstract
    Author Bhore S
    Conference LIPIcs, Volume 162, SWAT 2020
    Pages 13:1 - 13:18
    Link Publication
  • 2020
    Title Geometric Planar Networks on Bichromatic Points
    DOI 10.1007/978-3-030-39219-2_7
    Type Book Chapter
    Author Bandyapadhyay S
    Publisher Springer Nature
    Pages 79-91
  • 2018
    Title A visual comparison of hand-drawn and machine-generated human metabolic pathways
    Type Conference Proceeding Abstract
    Author M. Nöllenburg
    Conference Eurographics Conference on Visualization (EuroVis 2018) - Posters
    Pages 57-59
    Link Publication
  • 2021
    Title Layered Area-Proportional Rectangle Contact Representations
    DOI 10.48550/arxiv.2108.10711
    Type Preprint
    Author Nöllenburg M
  • 2021
    Title Geometric planar networks on bichromatic collinear points
    DOI 10.1016/j.tcs.2021.09.035
    Type Journal Article
    Author Bandyapadhyay S
    Journal Theoretical Computer Science
    Pages 124-136
    Link Publication
  • 2021
    Title Worbel
    DOI 10.1145/3474717.3483959
    Type Conference Proceeding Abstract
    Author Bhore S
    Pages 256-267
    Link Publication
  • 2021
    Title Unit Disk Representations of Embedded Trees, Outerplanar and Multi-legged Graphs
    DOI 10.1007/978-3-030-92931-2_22
    Type Book Chapter
    Author Bhore S
    Publisher Springer Nature
    Pages 304-317
  • 2021
    Title Layered Area-Proportional Rectangle Contact Representations
    DOI 10.1007/978-3-030-92931-2_23
    Type Book Chapter
    Author Nöllenburg M
    Publisher Springer Nature
    Pages 318-326
  • 2020
    Title The Turing Test for Graph Drawing Algorithms
    DOI 10.48550/arxiv.2008.04869
    Type Preprint
    Author Purchase H
  • 2020
    Title Towards Data-Driven Multilinear Metro Maps
    DOI 10.1007/978-3-030-54249-8_12
    Type Book Chapter
    Author Nickel S
    Publisher Springer Nature
    Pages 153-161
  • 2019
    Title Parameterized Algorithms for Book Embedding Problems
    DOI 10.48550/arxiv.1908.08911
    Type Preprint
    Author Bhore S
  • 2020
    Title The Turing Test for Graph Drawing Algorithms
    DOI 10.1007/978-3-030-68766-3_36
    Type Book Chapter
    Author Purchase H
    Publisher Springer Nature
    Pages 466-481
  • 2020
    Title Parameterized Algorithms for Queue Layouts
    DOI 10.1007/978-3-030-68766-3_4
    Type Book Chapter
    Author Bhore S
    Publisher Springer Nature
    Pages 40-54
  • 2020
    Title An algorithmic study of fully dynamic independent sets for map labeling
    Type Conference Proceeding Abstract
    Author Bhore
    Conference European Symposium on Algorithms (ESA 2020)
    Pages 19:1-19:24
    Link Publication
  • 2020
    Title Balanced Independent and Dominating Sets on Colored Interval Graphs
    DOI 10.48550/arxiv.2003.05289
    Type Preprint
    Author Bhore S
  • 2022
    Title Minimum Link Fencing
    DOI 10.48550/arxiv.2209.14804
    Type Preprint
    Author Bhore S
  • 2022
    Title Parameterized Study of Steiner Tree on Unit Disk Graphs
    DOI 10.1007/s00453-022-01020-z
    Type Journal Article
    Author Bhore S
    Journal Algorithmica
    Pages 133-152
  • 2022
    Title Transitions in Dynamic Point Labeling
    DOI 10.48550/arxiv.2202.11562
    Type Preprint
    Author Depian T
  • 2022
    Title Planarizing Graphs and their Drawings by Vertex Splitting
    DOI 10.48550/arxiv.2202.12293
    Type Preprint
    Author Nöllenburg M
  • 2022
    Title Multicriteria Optimization for Dynamic Demers Cartograms
    DOI 10.1109/tvcg.2022.3151227
    Type Journal Article
    Author Nickel S
    Journal IEEE Transactions on Visualization and Computer Graphics
    Pages 2376-2387
    Link Publication
  • 2022
    Title Turbocharging Heuristics for Weak Coloring Numbers
    DOI 10.48550/arxiv.2203.03358
    Type Preprint
    Author Dobler A
  • 2022
    Title Multi-Level Area Balancing of Clustered Graphs
    DOI 10.1109/tvcg.2020.3038154
    Type Journal Article
    Author Wu H
    Journal IEEE Transactions on Visualization and Computer Graphics
    Pages 2682-2696
    Link Publication
  • 2022
    Title Mixed Labeling: Integrating Internal and External Labels
    DOI 10.1109/tvcg.2020.3027368
    Type Journal Article
    Author Molk L
    Journal IEEE Transactions on Visualization and Computer Graphics
    Pages 1848-1861
  • 2022
    Title Geometric systems of unbiased representatives
    DOI 10.1016/j.ipl.2021.106232
    Type Journal Article
    Author Banik A
    Journal Information Processing Letters
    Pages 106232
    Link Publication
  • 2021
    Title Graph Models for Biological Pathway Visualization: State of the Art and Future Challenges
    DOI 10.48550/arxiv.2110.04808
    Type Preprint
    Author Wu H
  • 2021
    Title Untangling Circular Drawings: Algorithms and Complexity
    DOI 10.48550/arxiv.2111.09766
    Type Preprint
    Author Bhore S
  • 2021
    Title Unit Disk Representations of Embedded Trees, Outerplanar and Multi-Legged Graphs
    DOI 10.48550/arxiv.2103.08416
    Type Preprint
    Author Bhore S
  • 2021
    Title Balanced Independent and Dominating Sets on Colored Interval Graphs
    DOI 10.1007/978-3-030-67731-2_7
    Type Book Chapter
    Author Bhore S
    Publisher Springer Nature
    Pages 89-103
  • 2021
    Title Stable Visual Summaries for Trajectory Collections
    DOI 10.1109/pacificvis52677.2021.00016
    Type Conference Proceeding Abstract
    Author Wulms J
    Pages 61-70
    Link Publication
  • 2021
    Title Compacting Squares: Input-Sensitive In-Place Reconfiguration of Sliding Squares
    DOI 10.48550/arxiv.2105.07997
    Type Preprint
    Author Akitaya H
  • 0
    DOI 10.1145/3347146
    Type Other
Datasets & models
  • 2021 Link
    Title GeoWordle
    Type Database/Collection of data
    Public Access
    Link Link
  • 2020 Link
    Title DynaMIS
    Type Database/Collection of data
    Public Access
    Link Link
  • 2023 Link
    Title MySemCloud
    Type Computer model/algorithm
    Public Access
    Link Link
Scientific Awards
  • 2023
    Title JGAA co-editor in chief
    Type Appointed as the editor/advisor to a journal or book series
    Level of Recognition Continental/International
Fundings
  • 2023
    Title Parameterized Graph Drawing
    Type Research grant (including intramural programme)
    DOI 10.47379/ict22029
    Start of Funding 2023
    Funder Vienna Science and Technology Fund
  • 2020
    Title Engineering Linear Ordering Algorithms for Optimizing Data Visualizations
    Type Research grant (including intramural programme)
    DOI 10.47379/ict19035
    Start of Funding 2020
    Funder Vienna Science and Technology Fund

Discovering
what
matters.

Newsletter

FWF-Newsletter Press-Newsletter Calendar-Newsletter Job-Newsletter scilog-Newsletter

Contact

Austrian Science Fund (FWF)
Georg-Coch-Platz 2
(Entrance Wiesingerstraße 4)
1010 Vienna

office(at)fwf.ac.at
+43 1 505 67 40

General information

  • Job Openings
  • Jobs at FWF
  • Press
  • Philanthropy
  • scilog
  • FWF Office
  • Social Media Directory
  • LinkedIn, external URL, opens in a new window
  • , external URL, opens in a new window
  • Facebook, external URL, opens in a new window
  • Instagram, external URL, opens in a new window
  • YouTube, external URL, opens in a new window
  • Cookies
  • Whistleblowing/Complaints Management
  • Accessibility Statement
  • Data Protection
  • Acknowledgements
  • IFG-Form
  • Social Media Directory
  • © Österreichischer Wissenschaftsfonds FWF
© Österreichischer Wissenschaftsfonds FWF