## Stem triangl$ (all stems)

### 36 papers:

- PODS-2015-HuQT15a #dependence #testing
- Join Dependency Testing, Loomis-Whitney Join, and Triangle Enumeration (XH, MQ, YT), pp. 291–301.
- STOC-2015-AbboudWY
- Matching Triangles and Basing Hardness on an Extremely Popular Conjecture (AA, VVW, HY), pp. 41–50.
- KDD-2015-ElenbergSBD #distributed #framework #graph #scalability
- Beyond Triangles: A Distributed Framework for Estimating 3-profiles of Large Graphs (ERE, KS, MB, AGD), pp. 229–238.
- KDD-2015-LimK #graph #named
- MASCOT: Memory-efficient and Accurate Sampling for Counting Local Triangles in Graph Streams (YL, UK), pp. 685–694.
- PODS-2014-PaghS #complexity
- The input/output complexity of triangle enumeration (RP, FS), pp. 224–233.
- ICALP-v1-2014-BjorklundPWZ
- Listing Triangles (AB, RP, VVW, UZ), pp. 223–234.
- CIKM-2014-ParkSKP #pipes and filters
- MapReduce Triangle Enumeration With Guarantees (HMP, FS, UK, RP), pp. 1739–1748.
- KR-2014-DistelAB #concept #difference
- Concept Dissimilarity with Triangle Inequality (FD, JA, IB).
- VLDB-2013-PavanTTW #graph
- Counting and Sampling Triangles from a Graph Stream (AP, KT, ST, KLW), pp. 1870–1881.
- ICALP-v1-2013-BravermanOV #how #question #streaming
- How Hard Is Counting Triangles in the Streaming Model? (VB, RO, DV), pp. 244–254.
- ICALP-v2-2013-PettieS #algorithm #distributed #graph #performance
- Fast Distributed Coloring Algorithms for Triangle-Free Graphs (SP, HHS), pp. 681–693.
- HCI-AS-2013-Rampoldi-HniloS #collaboration #gamification #smarttech #social
- The Business Love Triangle- Smartphones, Gamification, and Social Collaboration (LRH, MS), pp. 309–315.
- CIKM-2013-ArifuzzamanKM #algorithm #named #network #parallel
- PATRIC: a parallel algorithm for counting triangles in massive networks (SA, MK, MVM), pp. 529–538.
- CIKM-2013-ParkC #algorithm #graph #performance #pipes and filters #scalability
- An efficient MapReduce algorithm for counting triangles in a very large graph (HMP, CWC), pp. 539–548.
- CIKM-2013-TangwongsanPT #graph #parallel #streaming
- Parallel triangle counting in massive streaming graphs (KT, AP, ST), pp. 781–786.
- KDD-2013-JhaSP #algorithm #performance #streaming #using
- A space efficient streaming algorithm for triangle counting using the birthday paradox (MJ, CS, AP), pp. 589–597.
- CIKM-2012-DurakPKS #graph #modelling #network
- Degree relations of triangles in real-world networks and graph models (ND, AP, TGK, CS), pp. 1712–1716.
- CIKM-2012-Prat-PerezDBL #community
- Shaping communities out of triangles (APP, DDS, JMB, JLLP), pp. 1677–1681.
- KDD-2011-ChuC #network
- Triangle listing in massive networks and its applications (SC, JC), pp. 672–680.
- ICPR-2010-GuoC10a #constraints
- Triangle-Constraint for Finding More Good Features (XG, XC), pp. 1393–1396.
- SAC-2010-Pham #geometry #proving
- Similar triangles and orientation in plane elementary geometry for Coq-based proofs (TMP), pp. 1268–1269.
- KDD-2009-TsourakakisKMF #graph #named
- DOULION: counting triangles in massive graphs with a coin (CET, UK, GLM, CF), pp. 837–846.
- KDD-2008-BecchettiBCG #algorithm #graph #performance
- Efficient semi-streaming algorithms for local triangle counting in massive graphs (LB, PB, CC, AG), pp. 16–24.
- AGTIVE-2007-TaentzerBBBBBGGHKMNPV #case study #generative #graph transformation #tool support
- Generation of Sierpinski Triangles: A Case Study for Graph Transformation Tools (GT, EB, DB, BB, IB, AB, LG, RG, ÁH, OK, TM, BN, DP, TV), pp. 514–539.
- PODS-2006-BuriolFLMS #data type
- Counting triangles in data streams (LSB, GF, SL, AMS, CS), pp. 253–262.
- STOC-2006-VassilevskaW #3d
- Finding a maximum weight triangle in n3-Delta time, with applications (VV, RW), pp. 225–231.
- TLCA-2005-SchurmannPS #calculus #encoding #functional #higher-order #programming
- The [triangle]-Calculus. Functional Programming with Higher-Order Encodings (CS, AP, JS), pp. 339–353.
- DAC-2004-LiYYYL #adaptation #algorithm #design #representation #using
- A packing algorithm for non-manhattan hexagon/triangle placement design by using an adaptive o-tree representation (JL, TY, BY, JY, CL), pp. 646–651.
- ICALP-2003-Blaser #algorithm #approximate #difference #symmetry
- An Improved Approximation Algorithm for the Asymmetric TSP with Strengthened Triangle Inequality (MB), pp. 157–163.
- ICML-2003-Elkan #difference #using
- Using the Triangle Inequality to Accelerate k-Means (CE), pp. 147–153.
- ICGT-2002-HageHW #graph
- Euler Graphs, Triangle-Free Graphs and Bipartite Graphs in Switching Classes (JH, TH, EW), pp. 148–160.
- ICPR-v2-2000-LinF #detection #geometry #using
- Human Face Detection Using Geometric Triangle Relationship (CL, KCF), pp. 2941–2944.
- ISSTA-2000-WoodwardA #fault #testing
- Testability, fault size and the domain-to-range ratio: An eternal triangle (MRW, ZAAK), pp. 168–172.
- ICALP-1998-GrafV #proving
- Reducing Simple Polygons to Triangles — A Proof for an Improved Conjecture (TG, KV), pp. 130–139.
- CHI-1998-GorbetOI #interface #named
- Triangles: Tangible Interface for Manipulation and Exploration of Digital Information Topography (MGG, MO, HI), pp. 49–56.
- ICPR-1998-HuTT #random
- Direct triangle extraction by a randomized Hough technique (ZH, MT, HTT), pp. 717–719.