Venkatesh Raman


Ontology type: schema:Person     


Person Info

NAME

Venkatesh

SURNAME

Raman

Publications in SciGraph latest 50 shown

  • 2019-01 Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs in ALGORITHMICA
  • 2018-11 Revisiting Connected Vertex Cover: FPT Algorithms and Lossy Kernels in THEORY OF COMPUTING SYSTEMS
  • 2018-11 Space Efficient Linear Time Algorithms for BFS, DFS and Applications in THEORY OF COMPUTING SYSTEMS
  • 2018-11 Polynomial Kernels for Vertex Cover Parameterized by Small Degree Modulators in THEORY OF COMPUTING SYSTEMS
  • 2018-09 Fréchet Distance Between a Line and Avatar Point Set in ALGORITHMICA
  • 2018-09 Structural Parameterizations of Undirected Feedback Vertex Set: FPT Algorithms and Kernelization in ALGORITHMICA
  • 2018-08 Approximability of Clique Transversal in Perfect Graphs in ALGORITHMICA
  • 2018-04-25 Structural Parameterizations of Dominating Set Variants in COMPUTER SCIENCE – THEORY AND APPLICATIONS
  • 2018-04-25 Maintaining Chordal Graphs Dynamically: Improved Upper and Lower Bounds in COMPUTER SCIENCE – THEORY AND APPLICATIONS
  • 2018-03-21 Some (in)tractable Parameterizations of Coloring and List-Coloring in FRONTIERS IN ALGORITHMICS
  • 2018-03-13 A Polynomial Sized Kernel for Tracking Paths Problem in LATIN 2018: THEORETICAL INFORMATICS
  • 2017-07 On the Succinct Representation of Equivalence Classes in ALGORITHMICA
  • 2017-05 On the Parameterized Complexity of Reconfiguration Problems in ALGORITHMICA
  • 2017 Improved Bounds for Poset Sorting in the Forbidden-Comparison Regime in ALGORITHMS AND DISCRETE APPLIED MATHEMATICS
  • 2017 Exact and Parameterized Algorithms for (k, i)-Coloring in ALGORITHMS AND DISCRETE APPLIED MATHEMATICS
  • 2017 FPT Algorithms for FVS Parameterized by Split and Cluster Vertex Deletion Sets and Other Parameters in FRONTIERS IN ALGORITHMICS
  • 2017 Parameterized Complexity of Geometric Covering Problems Having Conflicts in ALGORITHMS AND DATA STRUCTURES
  • 2017 The Complexity of Finding (Approximate Sized) Distance-d Dominating Set in Tournaments in FRONTIERS IN ALGORITHMICS
  • 2017 Elusiveness of Finding Degrees in ALGORITHMS AND DISCRETE APPLIED MATHEMATICS
  • 2016 Improved Space Efficient Algorithms for BFS, DFS and Applications in COMPUTING AND COMBINATORICS
  • 2016 Finding Mode Using Equality Comparisons in WALCOM: ALGORITHMS AND COMPUTATION
  • 2016 Harmonious Coloring: Parameterized Algorithms and Upper Bounds in GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE
  • 2015 Time-Space Tradeoffs for Dynamic Programming Algorithms in Trees and Bounded Treewidth Graphs in COMPUTING AND COMBINATORICS
  • 2015 Shortest Reconfiguration Paths in the Solution Space of Boolean Formulas in AUTOMATA, LANGUAGES, AND PROGRAMMING
  • 2015 Sorting and Selection with Equality Comparisons in ALGORITHMS AND DATA STRUCTURES
  • 2015 Space Efficient Data Structures for Nearest Larger Neighbor in COMBINATORIAL ALGORITHMS
  • 2014-03 Fixed-Parameter Tractability of Satisfying Beyond the Number of Variables in ALGORITHMICA
  • 2014-02 The Kernelization Complexity of Connected Domination in Graphs with (no) Small Cycles in ALGORITHMICA
  • 2014 LP Approaches to Improved Approximation for Clique Transversal in Perfect Graphs in ALGORITHMS - ESA 2014
  • 2014 Reconfiguration over Tree Decompositions in PARAMETERIZED AND EXACT COMPUTATION
  • 2014 Improved Explicit Data Structures in the Bitprobe Model in ALGORITHMS - ESA 2014
  • 2014 Vertex Cover Reconfiguration and Beyond in ALGORITHMS AND COMPUTATION
  • 2014 Tradeoff Between Label Space and Auxiliary Space for Representation of Equivalence Classes in ALGORITHMS AND COMPUTATION
  • 2014 The Complexity of Bounded Length Graph Recoloring and CSP Reconfiguration in PARAMETERIZED AND EXACT COMPUTATION
  • 2013-11 A Polynomial Kernel for Feedback Arc Set on Bipartite Tournaments in THEORY OF COMPUTING SYSTEMS
  • 2013-04 Guest Editorial: Special Issue on Parameterized and Exact Computation, Part II in ALGORITHMICA
  • 2013-03 The Parameterized Complexity of Unique Coverage and Its Variants in ALGORITHMICA
  • 2013 Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs in GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE
  • 2013 On the Parameterized Complexity of Reconfiguration Problems in PARAMETERIZED AND EXACT COMPUTATION
  • 2013 An FPT Algorithm for Tree Deletion Set in WALCOM: ALGORITHMS AND COMPUTATION
  • 2013 A Survey of Data Structures in the Bitprobe Model in SPACE-EFFICIENT DATA STRUCTURES, STREAMS, AND ALGORITHMS
  • 2013 Succinct Data Structures for Representing Equivalence Classes in ALGORITHMS AND COMPUTATION
  • 2013 Faster, Space-Efficient Selection Algorithms in Read-Only Memory for Integers in ALGORITHMS AND COMPUTATION
  • 2013 Upper and Lower Bounds for Weak Backdoor Set Detection in THEORY AND APPLICATIONS OF SATISFIABILITY TESTING – SAT 2013
  • 2013 Improved Fixed-Parameter Algorithm for the Minimum Weight 3-SAT Problem in WALCOM: ALGORITHMS AND COMPUTATION
  • 2013 Less Space: Indexing for Queries with Wildcards in ALGORITHMS AND COMPUTATION
  • 2012-09 Guest Editorial: Special Issue on Parameterized and Exact Computation, Part I in ALGORITHMICA
  • 2012-08 FPT algorithms for Connected Feedback Vertex Set in JOURNAL OF COMBINATORIAL OPTIMIZATION
  • 2012 Vertex Cover, Dominating Set and My Encounters with Parameterized Complexity and Mike Fellows in THE MULTIVARIATE ALGORITHMIC REVOLUTION AND BEYOND
  • 2012 Kernel Lower Bounds Using Co-nondeterminism: Finding Induced Hereditary Subgraphs in ALGORITHM THEORY – SWAT 2012
  • 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.462414.1", 
              "type": "Organization"
            }, 
            "isCurrent": true, 
            "type": "OrganizationRole"
          }, 
          {
            "id": "https://www.grid.ac/institutes/grid.46078.3d", 
            "type": "Organization"
          }
        ], 
        "familyName": "Raman", 
        "givenName": "Venkatesh", 
        "id": "sg:person.015145675270.07", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015145675270.07"
        ], 
        "sdDataset": "persons", 
        "sdDatePublished": "2019-03-07T14:14", 
        "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_1994.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.015145675270.07'

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

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

    Turtle is a human-readable linked data format.

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

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

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


     




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


    ...