Ioannis G Tollis


Ontology type: schema:Person     


Person Info

NAME

Ioannis G

SURNAME

Tollis

Publications in SciGraph latest 50 shown

  • 2018-01-21 Planar L-Drawings of Directed Graphs in GRAPH DRAWING AND NETWORK VISUALIZATION
  • 2018-01-21 Planar Drawings of Fixed-Mobile Bigraphs in GRAPH DRAWING AND NETWORK VISUALIZATION
  • 2016 Algorithms for Visualizing Phylogenetic Networks in GRAPH DRAWING AND NETWORK VISUALIZATION
  • 2016 L-Drawings of Directed Graphs in SOFSEM 2016: THEORY AND PRACTICE OF COMPUTER SCIENCE
  • 2015 2-Layer Fan-Planarity: From Caterpillar to Stegosaurus in GRAPH DRAWING AND NETWORK VISUALIZATION
  • 2014 Fan-Planar Graphs: Combinatorial Properties and Complexity Results in PROGRESS IN PATTERN RECOGNITION, IMAGE ANALYSIS, COMPUTER VISION, AND APPLICATIONS
  • 2013 Graph-theoretic Indices of Evaluating Brain Network Synchronization: Application in an Alcoholism Paradigm in MODERN ELECTROENCEPHALOGRAPHIC ASSESSMENT TECHNIQUES
  • 2013 Drawing Non-Planar Graphs with Crossing-Free Subgraphs in GRAPH DRAWING
  • 2013 DAGView: An Approach for Visualizing Large Graphs in GRAPH DRAWING
  • 2013 Weak Dominance Drawings for Directed Acyclic Graphs in GRAPH DRAWING
  • 2013 Exploring Complex Drawings via Edge Stratification in GRAPH DRAWING
  • 2012 Overloaded Orthogonal Drawings in GRAPH DRAWING
  • 2011-12 A computational exploration of bacterial metabolic diversity identifying metabolic interactions and growth-efficient strain communities in BMC SYSTEMS BIOLOGY
  • 2011 Placing Edge Labels by Modifying an Orthogonal Graph Drawing in GRAPH DRAWING
  • 2010 DAGmaps and Dominance Relationships in GRAPH DRAWING
  • 2010 DAGmaps and ε-Visibility Representations of DAGs in GRAPH DRAWING
  • 2009 DAGmap View in GRAPH DRAWING
  • 2009 Brain Network Analyzer in GRAPH DRAWING
  • 2008 Treemaps for Directed Acyclic Graphs in GRAPH DRAWING
  • 2007-03 SYMBIOmatics: Synergies in Medical Informatics and Bioinformatics – exploring current scientific literature for emerging topics in BMC BIOINFORMATICS
  • 2007 Parameterized st-Orientations of Graphs: Algorithms and Experiments in GRAPH DRAWING
  • 2007 Multi-level Analysis and Information Extraction Considerations for Validating 4D Models of Human Function in DIGITAL HUMAN MODELING
  • 2006 Visualization of Functional Aspects of microRNA Regulatory Networks Using the Gene Ontology in BIOLOGICAL AND MEDICAL DATA ANALYSIS
  • 2006 On the Topologies of Local Minimum Spanning Trees in COMBINATORIAL AND ALGORITHMIC ASPECTS OF NETWORKING
  • 2006 Searching and Visualizing Brain Networks in Schizophrenia in BIOLOGICAL AND MEDICAL DATA ANALYSIS
  • 2006 Applications of Parameterized st-Orientations in Graph Drawing Algorithms in GRAPH DRAWING
  • 2005 Using Treemaps to Visualize Phylogenetic Trees in BIOLOGICAL AND MEDICAL DATA ANALYSIS
  • 2005 3D Visualization of Semantic Metadata Models and Ontologies in GRAPH DRAWING
  • 2004 A Framework for User-Grouped Circular Drawings in GRAPH DRAWING
  • 2004 Visualization of Biological Information with Circular Drawings in BIOLOGICAL AND MEDICAL DATA ANALYSIS
  • 2004 ViSta — Visualizing Statecharts in GRAPH DRAWING SOFTWARE
  • 2003 Effective Graph Visualization Via Node Grouping in SOFTWARE VISUALIZATION
  • 2002-04-19 Circular Drawings of Biconnected Graphs in ALGORITHM ENGINEERING AND EXPERIMENTATION
  • 2002-02-21 Automated Visualization of Process Diagrams in GRAPH DRAWING
  • 2001 An Algorithmic Framework for Visualizing Statecharts in GRAPH DRAWING
  • 2000-03-03 A Framework for Circular Drawings of Networks in GRAPH DRAWING
  • 2000-01 Efficient Orthogonal Drawings of High Degree Graphs in ALGORITHMICA
  • 1999-01-15 Refinement of Orthogonal Graph Drawings in GRAPH DRAWING
  • 1999-01-15 Edge Labeling in the Graph Layout Toolkit in GRAPH DRAWING
  • 1997 On the Edge Label Placement problem in GRAPH DRAWING
  • 1997 The three-phase method: A unified approach to orthogonal graph drawing in GRAPH DRAWING
  • 1997 Orthogonal drawing of high degree graphs with small area and few bends in ALGORITHMS AND DATA STRUCTURES
  • 1997 An algorithm for labeling edges of hierarchical drawings in GRAPH DRAWING
  • 1997 Incremental orthogonal graph drawing in three dimensions in GRAPH DRAWING
  • 1997 Area requirement of Gabriel drawings (extended abstract) in ALGORITHMS AND COMPLEXITY
  • 1997 A pairing technique for area-efficient orthogonal drawings (extended abstract) in GRAPH DRAWING
  • 1997 Experimental and theoretical results in interactive orthogonal graph drawing in GRAPH DRAWING
  • 1996 Issues in interactive orthogonal graph drawing (preliminary version) in GRAPH DRAWING
  • 1995-10 A 2n−2 step algorithm for routing in ann ×n array with constant-size queues in ALGORITHMICA
  • 1995 Drawing telecommunication networks in GRAPH DRAWING
  • JSON-LD is the canonical representation for SciGraph data.

    TIP: You can open this SciGraph record using an external JSON-LD service: JSON-LD Playground Google SDTT

    [
      {
        "@context": "https://springernature.github.io/scigraph/jsonld/sgcontext.json", 
        "affiliation": [
          {
            "affiliation": {
              "id": "https://www.grid.ac/institutes/grid.8127.c", 
              "type": "Organization"
            }, 
            "isCurrent": true, 
            "type": "OrganizationRole"
          }, 
          {
            "id": "https://www.grid.ac/institutes/grid.4834.b", 
            "type": "Organization"
          }
        ], 
        "familyName": "Tollis", 
        "givenName": "Ioannis G", 
        "id": "sg:person.07523205527.24", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.07523205527.24"
        ], 
        "sdDataset": "persons", 
        "sdDatePublished": "2019-03-07T13:53", 
        "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
        "sdPublisher": {
          "name": "Springer Nature - SN SciGraph project", 
          "type": "Organization"
        }, 
        "sdSource": "s3://com-uberresearch-data-dimensions-researchers-20181010/20181011/dim_researchers/base/researchers_1651.json", 
        "type": "Person"
      }
    ]
     

    Download the RDF metadata as:  json-ld nt turtle xml License info

    HOW TO GET THIS DATA PROGRAMMATICALLY:

    JSON-LD is a popular format for linked data which is fully compatible with JSON.

    curl -H 'Accept: application/ld+json' 'https://scigraph.springernature.com/person.07523205527.24'

    N-Triples is a line-based linked data format ideal for batch operations.

    curl -H 'Accept: application/n-triples' 'https://scigraph.springernature.com/person.07523205527.24'

    Turtle is a human-readable linked data format.

    curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/person.07523205527.24'

    RDF/XML is a standard XML format for linked data.

    curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/person.07523205527.24'


     




    Preview window. Press ESC to close (or click here)


    ...