Telikepalli Kavitha


Ontology type: schema:Person     


Person Info

NAME

Telikepalli

SURNAME

Kavitha

Publications in SciGraph latest 50 shown

  • 2021-05-28 Popular branchings and their dual certificates in MATHEMATICAL PROGRAMMING
  • 2021-01-25 Popular Matchings in Complete Graphs in ALGORITHMICA
  • 2020-04-14 Popular Branchings and Their Dual Certificates in INTEGER PROGRAMMING AND COMBINATORIAL OPTIMIZATION
  • 2019-02-25 Two Problems in Max-Size Popular Matchings in ALGORITHMICA
  • 2018-09-02 Popular Matchings of Desired Size in GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE
  • 2017-08-07 Popular edges and dominant matchings in MATHEMATICAL PROGRAMMING
  • 2017-07-22 Distributed construction of purely additive spanners in DISTRIBUTED COMPUTING
  • 2016-12-15 New Pairwise Spanners in THEORY OF COMPUTING SYSTEMS
  • 2016-09-04 Distributed Construction of Purely Additive Spanners in DISTRIBUTED COMPUTING
  • 2016-05-25 Popular Edges and Dominant Matchings in INTEGER PROGRAMMING AND COMBINATORIAL OPTIMIZATION
  • 2015-06-23 Improved approximation algorithms for two variants of the stable marriage problem with ties in MATHEMATICAL PROGRAMMING
  • 2015-06-20 Maintaining Near-Popular Matchings in AUTOMATA, LANGUAGES, AND PROGRAMMING
  • 2015-06-20 Popular Matchings with Two-Sided Preferences and One-Sided Ties in AUTOMATA, LANGUAGES, AND PROGRAMMING
  • 2015-04-08 Fair Matchings and Related Problems in ALGORITHMICA
  • 2014-01-22 Dynamic Matrix Rank with Partial Lookahead in THEORY OF COMPUTING SYSTEMS
  • 2014 An Improved Approximation Algorithm for the Stable Marriage Problem with One-Sided Ties in INTEGER PROGRAMMING AND COMBINATORIAL OPTIMIZATION
  • 2013 Small Stretch Pairwise Spanners in AUTOMATA, LANGUAGES, AND PROGRAMMING
  • 2012-08-21 Popularity at minimum cost in JOURNAL OF COMBINATORIAL OPTIMIZATION
  • 2011-06-01 Faster Algorithms for All-Pairs Small Stretch Distances in Weighted Graphs in ALGORITHMICA
  • 2011 Popular Matchings in the Stable Marriage Problem in AUTOMATA, LANGUAGES AND PROGRAMMING
  • 2011 Near-Popular Matchings in the Roommates Problem in ALGORITHMS – ESA 2011
  • 2010-07-30 Bounded Unpopularity Matchings in ALGORITHMICA
  • 2010-01-28 Max-coloring paths: tight bounds and extensions in JOURNAL OF COMBINATORIAL OPTIMIZATION
  • 2010-01-12 Assigning Papers to Referees in ALGORITHMICA
  • 2010 Popularity at Minimum Cost in ALGORITHMS AND COMPUTATION
  • 2009-05-20 New Approximation Algorithms for Minimum Cycle Bases of Graphs in ALGORITHMICA
  • 2009 Popular Mixed Matchings in AUTOMATA, LANGUAGES AND PROGRAMMING
  • 2009 Popular Matchings with Variable Job Capacities in ALGORITHMS AND COMPUTATION
  • 2009 Max-Coloring Paths: Tight Bounds and Extensions in ALGORITHMS AND COMPUTATION
  • 2008-01-01 Bounded Unpopularity Matchings in ALGORITHM THEORY – SWAT 2008
  • 2008-01-01 On a Special Co-cycle Basis of Graphs in ALGORITHM THEORY – SWAT 2008
  • 2008 Faster Algorithms for Incremental Topological Ordering in AUTOMATA, LANGUAGES AND PROGRAMMING
  • 2007-10-13 An Algorithm for Minimum Cycle Basis of Graphs in ALGORITHMICA
  • 2007-06 Algorithms to Compute Minimum Cycle Basis in Directed Graphs in THEORY OF COMPUTING SYSTEMS
  • 2007-01-01 New Approximation Algorithms for Minimum Cycle Bases of Graphs in STACS 2007
  • 2007 Faster Algorithms for All-Pairs Small Stretch Distances in Weighted Graphs in FSTTCS 2007: FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE
  • 2006 Efficient Algorithms for Weighted Rank-Maximal Matchings and Related Problems in ALGORITHMS AND COMPUTATION
  • 2006 Dynamic Matching Markets and Voting Paths in ALGORITHM THEORY – SWAT 2006
  • 2006 A Faster Deterministic Algorithm for Minimum Cycle Bases in Directed Graphs in AUTOMATA, LANGUAGES AND PROGRAMMING
  • 2005 An Õ(m2n) Randomized Algorithm to Compute a Minimum Cycle Basis of a Directed Graph in AUTOMATA, LANGUAGES AND PROGRAMMING
  • 2005 A Polynomial Time Algorithm for Minimum Cycle Basis in Directed Graphs in STACS 2005
  • 2004 Strongly Stable Matchings in Time O(nm) and Extension to the Hospitals-Residents Problem in STACS 2004
  • 2004 A Faster Algorithm for Minimum Cycle Basis of Graphs in AUTOMATA, LANGUAGES AND PROGRAMMING
  • 2003-06-24 Isoperimetric Inequalities and the Width Parameters of Graphs in COMPUTING AND COMBINATORICS
  • 2003 Efficient Algorithms for Abelian Group Isomorphism and Related Problems in FST TCS 2003: FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE
  • 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": "http://www.grid.ac/institutes/grid.22401.35", 
              "type": "Organization"
            }, 
            "isCurrent": true, 
            "type": "OrganizationRole"
          }, 
          {
            "id": "http://www.grid.ac/institutes/grid.4372.2", 
            "type": "Organization"
          }, 
          {
            "id": "http://www.grid.ac/institutes/grid.34980.36", 
            "type": "Organization"
          }, 
          {
            "id": "http://www.grid.ac/institutes/grid.419528.3", 
            "type": "Organization"
          }
        ], 
        "familyName": "Kavitha", 
        "givenName": "Telikepalli", 
        "id": "sg:person.015551052213.83", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015551052213.83"
        ], 
        "sdDataset": "persons", 
        "sdDatePublished": "2022-12-01T07:13", 
        "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
        "sdPublisher": {
          "name": "Springer Nature - SN SciGraph project", 
          "type": "Organization"
        }, 
        "sdSource": "s3://com-springernature-scigraph/baseset/20221201/entities/gbq_results/person/person_804.jsonl", 
        "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.015551052213.83'

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

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

    Turtle is a human-readable linked data format.

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

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

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


     




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


    ...