Stem vertex$ (all stems)

66 papers:

PODS-2015-GuhaMT #graph

Vertex and Hyperedge Connectivity in Dynamic Graph Streams (SG, AM, DT), pp. 241–247.

VLDB-2015-AbdelazizHSKM #data analysis #framework #named #rdf

SPARTex: A Vertex-Centric Framework for RDF Data Analytics (IA, RH, SS, PK, NM), pp. 1880–1891.

VLDB-2015-RenW #graph #morphism #scalability

Exploiting Vertex Relationships in Speeding up Subgraph Isomorphism over Large Graphs (XR, JW), pp. 617–628.

VLDB-2015-ZhangC0 #approach #distributed #graph #set

Bonding Vertex Sets Over Distributed Graph: A Betweenness Aware Approach (XZ, HC, LC), pp. 1418–1429.

ICALP-v1-2015-GeorgiadisILP #graph

2-Vertex Connectivity in Directed Graphs (LG, GFI, LL, NP), pp. 605–616.

ICALP-v1-2015-HenzingerKL #component #polynomial

Finding 2-Edge and 2-Vertex Strongly Connected Components in Quadratic Time (MH, SK, VL), pp. 713–724.

ICALP-v1-2015-LokshtanovRS #algorithm #feedback #linear #set

Linear Time Parameterized Algorithms for Subset Feedback Vertex Set (DL, MSR, SS), pp. 935–946.

ICALP-v1-2015-WangW #algorithm #online

Two-sided Online Bipartite Matching and Vertex Cover: Beating the Greedy Algorithm (YW, SCwW), pp. 1070–1081.

KDD-2015-ZhouLB #analysis #clustering #graph

Integrating Vertex-centric Clustering with Edge-centric Clustering for Meta Path Graph Analysis (YZ, LL, DB), pp. 1563–1572.

SIGMOD-2014-AroraSB #graph #mining #statistics

Mining statistically significant connected subgraphs in vertex labeled graphs (AA, MS, AB), pp. 1003–1014.

VLDB-2014-SongCY0 #constraints

Repairing Vertex Labels under Neighborhood Constraints (SS, HC, JXY, LC), pp. 987–998.

ICALP-v1-2014-AllamigeonBG #algorithm #game studies #polynomial

The Tropical Shadow-Vertex Algorithm Solves Mean Payoff Games in Polynomial Time on Average (XA, PB, SG), pp. 89–100.

ICEIS-v1-2014-PinheiroCML #algorithm #graph

An Evolutionary Algorithm for Graph Planarisation by Vertex Deletion (RLP, AAC, CFXdM, DLS), pp. 464–471.

HPDC-2014-KhorasaniVGB #graph #named

CuSha: vertex-centric graph processing on GPUs (FK, KV, RG, LNB), pp. 239–252.

VLDB-2014-TianBCTM13 #graph

From “Think Like a Vertex” to “Think Like a Graph” (YT, AB, SAC, ST, JM), pp. 193–204.

ICALP-v1-2013-BrunschR #algorithm

Finding Short Paths on Polytopes by the Shadow Vertex Algorithm (TB, HR), pp. 279–290.

SIGMOD-2012-ChengKCC #approach #distance #graph #performance #query #scalability

Efficient processing of distance queries in large graphs: a vertex cover approach (JC, YK, SC, CC), pp. 457–468.

STOC-2012-Chuzhoy #on the

On vertex sparsifiers with Steiner nodes (JC), pp. 673–688.

ICALP-v1-2012-ChitnisCHM #feedback #parametricity #set

Directed Subset Feedback Vertex Set Is Fixed-Parameter Tractable (RHC, MC, MTH, DM), pp. 230–241.

KDD-2012-GleichS #community

Vertex neighborhoods, low conductance cuts, and good seeds for local community methods (DFG, CS), pp. 597–605.

SAC-2012-ChenGZG #metric #network #similarity #using

Discovering missing links in networks using vertex similarity measures (HHC, LG, X(Z, CLG), pp. 138–143.

ICALP-v1-2011-CyganPPW #feedback #parametricity #set

Subset Feedback Vertex Set Is Fixed-Parameter Tractable (MC, MP, MP, JOW), pp. 449–461.

ICALP-v1-2011-KuhnM #graph

Vertex Cover in Graphs with Locally Few Colors (FK, MM), pp. 498–509.

ICALP-v2-2011-HermelinLWY #distance #graph

Distance Oracles for Vertex-Labeled Graphs (DH, AL, OW, RY), pp. 490–501.

STOC-2010-LeightonM

Extensions and limits to vertex sparsification (FTL, AM), pp. 47–56.

STOC-2010-OnakR #maintenance #scalability

Maintaining a large matching and a small vertex cover (KO, RR), pp. 457–464.

ICALP-v1-2010-BansalK #problem #scheduling

Inapproximability of Hypergraph Vertex Cover and Applications to Scheduling Problems (NB, SK), pp. 250–261.

ICALP-v1-2010-Georgiadis #graph #testing

Testing 2-Vertex Connectivity and Computing Pairs of Vertex-Disjoint s-t Paths in Digraphs (LG), pp. 738–749.

ICALP-v1-2010-GuruswamiS #on the

On the Inapproximability of Vertex Cover on k-Partite k-Uniform Hypergraphs (VG, RS), pp. 360–371.

ICPR-2010-RichiardiVRB #classification #graph #sequence

Vector Space Embedding of Undirected Graphs with Fixed-cardinality Vertex Sequences for Classification (JR, DVDV, KR, HB), pp. 902–905.

STOC-2008-ChakrabortyCK #design #network

Network design for vertex connectivity (TC, JC, SK), pp. 167–176.

STOC-2008-ChenLL #algorithm #feedback #parametricity #problem #set

A fixed-parameter algorithm for the directed feedback vertex set problem (JC, YL, SL, BO, IR), pp. 177–186.

STOC-2008-FakcharoenpholL #algorithm #approximate #problem

An o(log2 k)-approximation algorithm for the k-vertex connected spanning subgraph problem (JF, BL), pp. 153–158.

ICALP-A-2008-YoshidaI #graph #testing

Property Testing on k-Vertex-Connectivity of Graphs (YY, HI), pp. 539–550.

STOC-2007-BrinkmanKL #graph #random #reduction

Vertex cuts, random walks, and dimension reduction in series-parallel graphs (BB, AK, JRL), pp. 621–630.

STOC-2007-SchoenebeckTT

Tight integrality gaps for Lovasz-Schrijver LP relaxations of vertex cover and max cut (GS, LT, MT), pp. 302–310.

ICALP-2007-FellowsFHV #graph

Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs (MRF, GF, DH, SV), pp. 340–351.

ICALP-2007-Korman

Labeling Schemes for Vertex Connectivity (AK), pp. 102–109.

LATA-2007-Kresz #automaton #nondeterminism

Nondeterministic soliton automata with a single external vertex (MK), pp. 319–330.

ICGT-2006-BerwangerJ #automaton #graph

Automata on Directed Graphs: Edge Versus Vertex Marking (DB, DJ), pp. 46–60.

SAT-2006-NishimuraRS #satisfiability #using

Solving #SAT Using Vertex Covers (NN, PR, SS), pp. 396–409.

DATE-2005-TeslenkoD #algorithm #graph #performance

An Efficient Algorithm for Finding Double-Vertex Dominators in Circuit Graphs (MT, ED), pp. 406–411.

STOC-2005-FeigeHL #algorithm #approximate

Improved approximation algorithms for minimum-weight vertex separators (UF, MTH, JRL), pp. 563–572.

ICALP-2005-Karakostas #approximate #problem

A Better Approximation Ratio for the Vertex Cover Problem (GK), pp. 1043–1050.

STOC-2003-AmirKR #approximate #constant #graph

Constant factor approximation of vertex-cuts in planar graphs (EA, RK, SR), pp. 90–99.

STOC-2003-DinurGKR #multi

A new multilayered PCP and the hardness of hypergraph vertex cover (ID, VG, SK, OR), pp. 595–601.

ICALP-2003-GandhiHKKS #algorithm #approximate

An Improved Approximation Algorithm for Vertex Cover with Hard Capacities (RG, EH, SK, GK, AS), pp. 164–175.

SAT-2003-MneimnehS #graph #scalability

Computing Vertex Eccentricity in Exponentially Large Graphs: QBF Formulation and Solution (MNM, KAS), pp. 411–425.

STOC-2002-CheriyanVV #algorithm #approximate #low cost

Approximation algorithms for minimum-cost k-vertex connected subgraphs (JC, SV, AV), pp. 306–312.

STOC-2002-Holmerin #approximate

Vertex cover on 4-regular hyper-graphs is hard to approximate within 2-epsilon (JH), pp. 544–552.

ICALP-2002-Holmerin

Improved Inapproximability Results for Vertex Cover on k -Uniform Hypergraphs (JH), pp. 1005–1016.

ICGT-2002-WooY #order

Hierarchical Vertex Ordering (SHW, SBY), pp. 393–401.

SAC-2002-VedovaW #algorithm

Optimal algorithms for local vertex quartet cleaning (GDV, TW), pp. 173–177.

STOC-1998-BlumKRV #problem

Semi-Definite Relaxations for Minimum Bandwidth and other Vertex-Ordering Problems (AB, GK, RR, SV), pp. 100–105.

SAC-1998-WangA #approach #retrieval

A vertex-based shape coding approach for similar shape retrieval (JW, RA), pp. 520–522.

SAC-1995-Li #algorithm #optimisation #performance #set

An efficient algorithm for computing a minimum node cutset from a vertex-disjoint path set for timing optimization (WNL), pp. 56–60.

DAC-1994-AsharM #low cost #set

Implicit Computation of Minimum-Cost Feedback-Vertex Sets for Partial Scan and Other Applications (PA, SM), pp. 77–80.

STOC-1994-DinitzV #graph #incremental #maintenance #set

The connectivity carcass of a vertex subset in a graph and its incremental maintenance (YD, AV), pp. 716–725.

ICALP-1994-NikolestseasPSY #graph #multi #network #random #reliability

Short Vertex Disjoint Paths and Multiconnectivity in Random Graphs: Reliable Network Computing (SEN, KVP, PGS, MY), pp. 508–519.

TAGT-1994-Bauderon #approach #generative #graph #infinity

A Category-Theoretical Approach to Vertex Replacement: The Generation of Infinite Graphs (MB), pp. 27–37.

STOC-1991-Babai #finite #generative #graph #random #transitive

Local Expansion of Vertex-Transitive Graphs and Random Generation in Finite Groups (LB), pp. 164–174.

STOC-1991-CheriyanT #algorithm #parallel

Algorithms for Parallel k-Vertex Connectivity and Sparse Certificates (Extended Abstract) (JC, RT), pp. 391–401.

ICALP-1986-VarmanD #algorithm #parallel

A Parallel Vertex Insertion Algorithm For Minimum Spanning Trees (PJV, KD), pp. 424–433.

ICALP-1985-Lovasz #algorithm

Vertex Packing Algorithms (LL), pp. 1–14.

STOC-1982-Bar-YehudaE #approximate #graph #on the

On Approximating a Vertex Cover for Planar Graphs (RBY, SE), pp. 303–309.

STOC-1975-RoseT #algorithm #aspect-oriented

Algorithmic Aspects of Vertex Elimination (DJR, RET), pp. 245–254.