Stem convex$ (all stems)

154 papers:

CASE-2015-BlanchiniFGP #programming

Inverse kinematics by means of convex programming: Some developments (FB, GF, GG, FAP), pp. 515–520.

VLDB-2015-LazersonSKSGS #distributed #monitoring #using

Monitoring Distributed Streams using Convex Decompositions (AL, IS, DK, AS, MNG, VS), pp. 545–556.

FoSSaCS-2015-JacobsWW #set

States of Convex Sets (BJ, BW, BW), pp. 87–101.

SANER-2015-MattsenWS #abstract domain #analysis

A non-convex abstract domain for the value analysis of binaries (SM, AW, SS), pp. 271–280.

ICML-2015-AybatWI #distributed #optimisation

An Asynchronous Distributed Proximal Gradient Method for Composite Convex Optimization (NSA, ZW, GI), pp. 2454–2462.

ICML-2015-CilibertoMPR #learning #multi

Convex Learning of Multiple Tasks and their Structure (CC, YM, TAP, LR), pp. 1548–1557.

ICML-2015-GarberH #performance #set

Faster Rates for the Frank-Wolfe Method over Strongly-Convex Sets (DG, EH), pp. 541–549.

ICML-2015-LimCX #clustering #framework #optimisation

A Convex Optimization Framework for Bi-Clustering (SHL, YC, HX), pp. 1679–1688.

ICML-2015-LondonHG #approximate #learning

The Benefits of Learning with Strongly Convex Approximate Inference (BL, BH, LG), pp. 410–418.

ICML-2015-PlessisNS #learning

Convex Formulation for Learning from Positive and Unlabeled Data (MCdP, GN, MS), pp. 1386–1394.

ICML-2015-RamaswamyT0 #classification

Convex Calibrated Surrogates for Hierarchical Classification (HGR, AT, SA), pp. 1852–1860.

ICML-2015-SaRO #convergence #matrix #probability #problem

Global Convergence of Stochastic Gradient Descent for Some Non-convex Matrix Problems (CDS, CR, KO), pp. 2332–2341.

ICML-2015-YenLZRD #approach #modelling #process

A Convex Exemplar-based Approach to MAD-Bayes Dirichlet Process Mixture Models (IEHY, XL, KZ, PKR, ISD), pp. 2418–2426.

CASE-2014-HuangCM #optimisation

Motion planning of a 7-axis robot manipulator via Modified Tension Spline and convex optimization (SH, HHC, AGM), pp. 1278–1283.

ICML-c1-2014-LiuYF #algorithm #constraints

Forward-Backward Greedy Algorithms for General Convex Smooth Functions over A Cardinality Constraint (JL, JY, RF), pp. 503–511.

ICML-c2-2014-ChenGH

Near-Optimal Joint Object Matching via Convex Relaxation (YC, LJG, QXH), pp. 100–108.

ICML-c2-2014-MalioutovS

Convex Total Least Squares (DM, NS), pp. 109–117.

ICML-c2-2014-QinLJ #learning #optimisation

Sparse Reinforcement Learning via Convex Optimization (ZQ, WL, FJ), pp. 424–432.

ICPR-2014-BorgiLEA14a #multi #recognition #using

Sparse Multi-regularized Shearlet-Network Using Convex Relaxation for Face Recognition (MAB, DL, ME, CBA), pp. 4636–4641.

ICPR-2014-IoannidisCL #clustering #modelling #multi #using

Key-Frame Extraction Using Weighted Multi-view Convex Mixture Models and Spectral Clustering (AI, VC, AL), pp. 3463–3468.

ICPR-2014-YooJKC #learning #optimisation

Transfer Learning of Motion Patterns in Traffic Scene via Convex Optimization (YJY, HJ, SWK, JYC), pp. 4158–4163.

MLDM-2014-SenkoD #multi

Multiple Regression Method Based on Unexpandable and Irreducible Convex Combinations (OVS, AD), pp. 43–57.

RecSys-2014-Aiolli #feedback #optimisation #recommendation

Convex AUC optimization for top-N recommendation with implicit feedback (FA), pp. 293–296.

DATE-2013-UnutulmazDF #optimisation #using

Area optimization on fixed analog floorplans using convex area functions (AU, GD, FVF), pp. 1843–1848.

ICDAR-2013-0001LBP #approximate #documentation #graph #string #visual notation

Near Convex Region Adjacency Graph and Approximate Neighborhood String Matching for Symbol Spotting in Graphical Documents (AD, JL, HB, UP), pp. 1078–1082.

ICALP-v1-2013-BlasiusRW #graph #orthogonal

Optimal Orthogonal Graph Drawing with Convex Bend Costs (TB, IR, DW), pp. 184–195.

ICML-c1-2013-DoK

Convex formulations of radius-margin based Support Vector Machines (HD, AK), pp. 169–177.

ICML-c1-2013-HallW #modelling #online #programming

Dynamical Models and tracking regret in online convex programming (ECH, RW), pp. 579–587.

ICML-c1-2013-Jaggi #optimisation

Revisiting Frank-Wolfe: Projection-Free Sparse Convex Optimization (MJ), pp. 427–435.

ICML-c1-2013-KumarB #bound #graph #learning

Convex Relaxations for Learning Bounded-Treewidth Decomposable Graphs (KSSK, FRB), pp. 525–533.

ICML-c1-2013-RamdasS #optimisation #probability

Optimal rates for stochastic convex optimization under Tsybakov noise condition (AR, AS), pp. 365–373.

ICML-c1-2013-TorkamaniL #classification

Convex Adversarial Collective Classification (MT, DL), pp. 642–650.

ICML-c2-2013-GongZLHY #algorithm #optimisation #problem

A General Iterative Shrinkage and Thresholding Algorithm for Non-convex Regularized Optimization Problems (PG, CZ, ZL, JH, JY), pp. 37–45.

ICML-c3-2013-DalalyanHMS #learning #modelling #programming

Learning Heteroscedastic Models by Convex Programming under Group Sparsity (ASD, MH, KM, JS), pp. 379–387.

ICML-c3-2013-JancsaryNR #learning #predict

Learning Convex QP Relaxations for Structured Prediction (JJ, SN, CR), pp. 915–923.

ICML-c3-2013-ZhangYJH #optimisation #probability

O(logT) Projections for Stochastic Optimization of Smooth and Strongly Convex Functions (LZ, TY, RJ, XH), pp. 1121–1129.

KDD-2013-NarasimhanA #bound #named #optimisation

SVMpAUCtight: a new support vector method for optimizing partial AUC based on a tight convex upper bound (HN, SA), pp. 167–175.

SAC-2013-BarrosJBFBF #gesture #recognition #sequence

Convexity local contour sequences for gesture recognition (PVAB, NTMJ, JMMB, BJTF, BLDB, SMMF), pp. 34–39.

CAV-2013-PuggelliLSS #nondeterminism #polynomial #verification

Polynomial-Time Verification of PCTL Properties of MDPs with Convex Uncertainties (AP, WL, ALSV, SAS), pp. 527–542.

CSL-2013-Maruyama #category theory #monad

Categorical Duality Theory: With Applications to Domains, Convexity, and the Distribution Monad (YM), pp. 500–520.

VMCAI-2013-SeladjiB #abstract domain #analysis #fixpoint #tool support #using

Fixpoint Computation in the Polyhedra Abstract Domain Using Convex and Numerical Analysis Tools (YS, OB), pp. 149–168.

STOC-2012-Vegh #algorithm #low cost #polynomial #problem

Strongly polynomial algorithm for a class of minimum-cost flow problems with separable convex objectives (LAV), pp. 27–40.

ICALP-v1-2012-BarmanUCM #problem

Secretary Problems with Convex Costs (SB, SU, SC, DLM), pp. 75–87.

ICML-2012-Ben-DavidLSS #classification #fault #using

Minimizing The Misclassification Error Rate Using a Surrogate Convex Loss (SBD, DL, NS, KS), p. 16.

ICML-2012-HannahD #design #geometry #programming

Ensemble Methods for Convex Regression with Applications to Geometric Programming Based Circuit Design (LH, DBD), p. 24.

ICML-2012-JawanpuriaN #learning

A Convex Feature Learning Formulation for Latent Task Structure Discovery (PJ, JSN), p. 199.

ICML-2012-JoulinB #classification

A convex relaxation for weakly supervised classifiers (AJ, FRB), p. 171.

ICML-2012-Laue #algorithm #hybrid #optimisation

A Hybrid Algorithm for Convex Semidefinite Optimization (SL), p. 142.

ICML-2012-NeufeldYZKS #reduction

Regularizers versus Losses for Nonlinear Dimensionality Reduction: A Factored View with New Convex Relaxations (JN, YY, XZ, RK, DS), p. 191.

ICML-2012-RakhlinSS #optimisation #probability

Making Gradient Descent Optimal for Strongly Convex Stochastic Optimization (AR, OS, KS), p. 204.

ICML-2012-ReidWS #design #multi

The Convexity and Design of Composite Multiclass Losses (MDR, RCW, PS), p. 36.

ICML-2012-ZhongK #clustering #flexibility #learning #multi

Convex Multitask Learning with Flexible Task Clusters (WZ, JTYK), p. 66.

ICPR-2012-PengWK #segmentation

A new convex variational model for liver segmentation (JP, JW, DK), pp. 3754–3757.

ICPR-2012-SeredinMTRW #multimodal #pattern matching #pattern recognition #recognition

Convex support and Relevance Vector Machines for selective multimodal pattern recognition (OS, VM, AT, NR, DW), pp. 1647–1650.

SAC-2012-YuHJSLH #novel #programming #segmentation

A novel segmentation method for convex lesions based on dynamic programming with local intra-class variance (MY, QH, RJ, ES, HL, CCH), pp. 39–44.

VMCAI-2012-GhorbalIBMG #abstract interpretation #performance

Donut Domains: Efficient Non-convex Domains for Abstract Interpretation (KG, FI, GB, NM, AG), pp. 235–250.

STOC-2011-DughmiRY #combinator #optimisation #random #towards

From convex optimization to randomized mechanisms: toward optimal combinatorial auctions (SD, TR, QY), pp. 149–158.

ICML-2011-AgarwalNW #composition #matrix

Noisy matrix decomposition via convex relaxation: Optimal rates in high dimensions (AA, SN, MJW), pp. 1129–1136.

ICML-2011-GrubbB #algorithm #optimisation

Generalized Boosting Algorithms for Convex Optimization (AG, DB), pp. 1209–1216.

ICML-2011-HockingVBJ #algorithm #clustering #named #using

Clusterpath: an Algorithm for Clustering using Convex Fusion Penalties (TH, JPV, FRB, AJ), pp. 745–752.

ICML-2011-JalaliCSX #clustering #graph #optimisation

Clustering Partially Observed Graphs via Convex Optimization (AJ, YC, SS, HX), pp. 1001–1008.

ICML-2011-PengHMU #set

Convex Max-Product over Compact Sets for Protein Folding (JP, TH, DAM, RU), pp. 729–736.

ICML-2011-Shalev-ShwartzGS #constraints #rank #scalability

Large-Scale Convex Minimization with a Low-Rank Constraint (SSS, AG, OS), pp. 329–336.

KDD-2011-Boyd #distributed #embedded #optimisation #realtime #scalability

Convex optimization: from embedded real-time to large-scale distributed (SB), p. 1.

POPL-2011-PouchetBBCRSV #optimisation

Loop transformations: convexity, pruning and optimization (LNP, UB, CB, AC, JR, PS, NV), pp. 549–562.

LATA-2010-Brzozowski #complexity

Complexity in Convex Languages (JAB), pp. 1–15.

ICPR-2010-TakahashiK #approximate #classification

Margin Preserved Approximate Convex Hulls for Classification (TT, MK), pp. 4052–4055.

SAC-2010-BaeAVNB #algorithm #performance #search-based

Convex onion peeling genetic algorithm: an efficient solution to map labeling of point-feature (WDB, SA, PV, SN, KYB), pp. 892–899.

VMCAI-2010-BuZL #automaton #hybrid #programming #reachability #using #verification

Path-Oriented Reachability Verification of a Class of Nonlinear Hybrid Automata Using Convex Programming (LB, JZ, XL), pp. 78–94.

DATE-2009-DabiriVPS #energy #realtime

Energy minimization for real-time systems with non-convex and discrete operation modes (FD, AV, MP, MS), pp. 1416–1421.

TACAS-2009-SchollDPK #constraints #detection #linear

Computing Optimized Representations for Non-convex Polyhedra by Detection and Removal of Redundant Linear Constraints (CS, SD, FP, SK), pp. 383–397.

CIAA-J-2008-CantinLW09 #automaton

Computing Convex Hulls by Automata Iteration (FC, AL, PW), pp. 647–667.

LATA-2009-BrzozowskiSX #problem

Decision Problems for Convex Languages (JAB, JS, ZX), pp. 247–258.

HIMI-DIE-2009-ShinPC #bound #detection

Virtual Convex Polygon Based Hole Boundary Detection and Time Delay Based Hole Detour Scheme in WSNs (IS, NDP, HC), pp. 619–627.

ICML-2009-ChenTLY #learning #multi

A convex formulation for learning shared structures from multiple tasks (JC, LT, JL, JY), pp. 137–144.

ICML-2009-NickischS #linear #modelling #scalability

Convex variational Bayesian inference for large scale generalized linear models (HN, MWS), pp. 761–768.

MLDM-2009-Calliess #on the

On Fixed Convex Combinations of No-Regret Learners (JPC), pp. 494–504.

DATE-2008-MuraliMAGBBM #manycore #optimisation #using

Temperature Control of High-Performance Multi-core Platforms Using Convex Optimization (SM, AM, DA, RG, SPB, LB, GDM), pp. 110–115.

VLDB-2008-PerlmanBK

Organizing and indexing non-convex regions (EAP, RCB, MMK), pp. 1500–1503.

FoSSaCS-2008-Goubault-Larrecq08a

Prevision Domains and Convex Powercones (JGL), pp. 318–333.

SAS-2008-Leroux #automaton

Convex Hull of Arithmetic Automata (JL), pp. 47–61.

AFL-2008-Bercoff #product line

Counting of a family of column-convex rectilinear tiles (CB), pp. 100–110.

CIAA-2008-CantinLW #automaton

Computing Convex Hulls by Automata Iteration (FC, AL, PW), pp. 112–121.

CIKM-2008-AcharyyaG #analysis #product line

A spam resistant family of concavo-convex ranks for link analysis (SA, JG), pp. 1505–1506.

ICML-2008-GordonGM #game studies #learning

No-regret learning in convex games (GJG, AG, CM), pp. 360–367.

ICML-2008-KumarT #estimation

Efficiently solving convex relaxations for MAP estimation (MPK, PHST), pp. 680–687.

ICML-2008-LongS #classification #random

Random classification noise defeats all convex potential boosters (PML, RAS), pp. 608–615.

ICML-2008-YuVGS #approach #optimisation

A quasi-Newton approach to non-smooth convex optimization (JY, SVNV, SG, NNS), pp. 1216–1223.

ICPR-2008-RiveraCT #image #polynomial #programming #segmentation

Image segmentation by convex quadratic programming (MR, ODC, JT), pp. 1–5.

ICPR-2008-RoussillonST #composition #robust

Robust decomposition of a digital curve into convex and concave parts (TR, IS, LT), pp. 1–4.

ICPR-2008-RoyPLK #approach #documentation #multi #recognition #visual notation

Convex hull based approach for multi-oriented character recognition from graphical documents (PPR, UP, JL, FK), pp. 1–4.

SIGIR-2008-YuZXG #categorisation #design #learning #using

trNon-greedy active learning for text categorization using convex ansductive experimental design (KY, SZ, WX, YG), pp. 635–642.

CASE-2007-MitaniYH #analysis #using

Feeding of Submillimeter-sized Microparts along a Saw-tooth Surface Using Only Horizontal Vibration: Analysis of Convexities on the Surface of Microparts (AM, TY, SH), pp. 69–76.

CASE-2007-VahediS #geometry

Geometric Properties and Computation of Three-Finger Caging Grasps of Convex Polygons (MV, AFvdS), pp. 404–411.

DATE-2007-LinXZ #design #network

Design closure driven delay relaxation based on convex cost network flow (CL, AX, HZ), pp. 63–68.

LATA-2007-BoldiLRS

The Number of Convex Permutominoes (PB, VL, RR, MS), pp. 151–162.

ICML-2007-ChanVL

Direct convex relaxations of sparse SVM (ABC, NV, GRGL), pp. 145–153.

ICML-2007-LongZWY #clustering #relational #symmetry

Relational clustering by symmetric convex coding (BL, Z(Z, XW, PSY), pp. 569–576.

KDD-2007-TeoSVL #composition #scalability

A scalable modular convex solver for regularized risk minimization (CHT, AJS, SVNV, QVL), pp. 727–736.

ICML-2006-BanerjeeGdN #modelling #optimisation #visual notation

Convex optimization techniques for fitting sparse Gaussian graphical models (OB, LEG, Ad, GN), pp. 89–96.

ICML-2006-CollobertSWB #scalability

Trading convexity for scalability (RC, FHS, JW, LB), pp. 201–208.

ICPR-v1-2006-AokiK #3d #detection

Detection of 3D-Flow by Characteristic of Convex-concave and Color (KA, HK), pp. 75–78.

ICPR-v2-2006-MavroforakisST #algorithm #geometry #novel

A novel SVM Geometric Algorithm based on Reduced Convex Hulls (MEM, MS, ST), pp. 564–568.

ICPR-v3-2006-JiangDL #locality #polynomial #programming

Convex Quadratic Programming for Object Localization (HJ, MSD, ZNL), pp. 24–27.

ICPR-v3-2006-ShinT #3d #generative

Triangular Mesh Generation of Octrees of Non-Convex 3D Objects (DS, TT), pp. 950–953.

SAC-2006-OrshanskyWCX #analysis #robust #statistics

Interval-based robust statistical techniques for non-negative convex functions, with application to timing analysis of computer chips (MO, WSW, MC, GX), pp. 1645–1649.

DAC-2005-SouMD #approach #optimisation #order #reduction

A quasi-convex optimization approach to parameterized model order reduction (KCS, AM, LD), pp. 933–938.

DAC-2005-TennakoonS #modelling #performance

Efficient and accurate gate sizing with piecewise convex delay models (HT, CS), pp. 807–812.

SAS-2005-BagnaraRZ #algebra #generative #invariant #using

Generation of Basic Semi-algebraic Invariants Using Convex Polyhedra (RB, ERC, EZ), pp. 19–34.

STOC-2005-AzarE #parallel #programming #scheduling

Convex programming for scheduling unrelated parallel machines (YA, AE), pp. 331–337.

MLDM-2005-TakigawaKN #classification #combinator #product line #set #subclass

The Convex Subclass Method: Combinatorial Classifier Based on a Family of Convex Sets (IT, MK, AN), pp. 90–99.

ICALP-2004-GairingLMMR #game studies #latency #nash

Nash Equilibria in Discrete Routing Games with Convex Latency Functions (MG, TL, MM, BM, MR), pp. 645–657.

ICPR-v1-2004-RahtuSH #multi #recognition #using

Convexity Recognition Using Multi-Scale Autoconvolution (ER, MS, JH), pp. 692–695.

ICPR-v1-2004-YuanSKR #estimation #image

Convex Set-Based Estimation of Image Flows (JY, CS, TK, PR), pp. 124–127.

ICPR-v3-2004-GanLY #array #estimation #set

Missing Microarray Data Estimation Based on Projection onto Convex Sets Method (XG, AWCL, HY), pp. 782–785.

ICPR-v4-2004-NockN #algorithm #clustering #optimisation

Improving Clustering Algorithms through Constrained Convex Optimization (RN, FN), pp. 557–560.

ICPR-v4-2004-RosinM #symmetry

A Symmetric Convexity Measure (PLR, CLM), pp. 11–14.

LICS-2004-Latour #automaton #integer

From Automata to Formulas: Convex Integer Polyhedra (LL), pp. 120–129.

SAS-2003-BagnaraHRZ #precise

Precise Widening Operators for Convex Polyhedra (RB, PMH, ER, EZ), pp. 337–354.

ICML-2003-Zinkevich #online #programming

Online Convex Programming and Generalized Infinitesimal Gradient Ascent (MZ), pp. 928–936.

DATE-2002-LinCC #using

Arbitrary Convex and Concave Rectilinear Module Packing Using TCG (JML, HLC, YWC), pp. 69–75.

SAS-2002-BagnaraRZH #library

Possibly Not Closed Convex Polyhedra and the Parma Polyhedra Library (RB, ER, EZ, PMH), pp. 213–229.

STOC-2002-BertsimasV #random #source code

Solving convex programs by random walks (DB, SV), pp. 109–115.

ICPR-v1-2002-YuK #3d #approximate #estimation

An Approximative Calculation of Relative Convex Hulls for Surface Area Estimation of 3D Digital Objects (LY, RK), pp. 131–134.

ICPR-v2-2002-YangP02b #3d #detection #named

CHEF: Convex Hull of Elliptic Features for 3D Blob Detection (QY, BP), pp. 282–285.

LOPSTR-2002-PeraltaG #abstraction #source code

Convex Hull Abstractions in Specialization of CLP Programs (JCP, JPG), pp. 90–108.

STOC-2001-IckingM #3d #bound #complexity #diagrams #distance

A tight bound for the complexity of voroni diagrams under polyhedral convex distance functions in 3D (CI, LM), pp. 316–321.

DAC-2000-KetkarKS #modelling

Convex delay models for transistor sizing (MK, KK, SSS), pp. 655–660.

ICPR-v1-2000-SatoSO #3d

3D Shape Recovery of Non-Convex Object from Rotation (TS, HS, SO), pp. 1742–1745.

ICPR-v1-2000-TankusY

Convexity-Based Camouflage Breaking (AT, YY), pp. 1454–1457.

ICPR-v3-2000-Pham #image

Image Restoration by Ordinary Kriging with Convexity (TDP), pp. 3334–3337.

STOC-1999-Schaeffer #random #scalability

Random Sampling of Large Planar Maps and Convex Polyhedra (GS), pp. 760–769.

ICPR-1998-Kakarala #fourier #testing

Testing for convexity with Fourier descriptors (RK), pp. 792–794.

ICPR-1996-KobatakeM #adaptation #detection

Adaptive filter to detect rounded convex regions: iris filter (HK, MM), pp. 340–344.

ICPR-1996-Popov #fuzzy #metric

Fuzzy morphology and fuzzy convexity measures (ATP), pp. 611–614.

ICPR-1996-SchlicherBV #locality #performance

Fast analytical medial-axis localization in convex polyhedra (MPPS, EB, PWV), pp. 55–61.

ICPR-1996-TuzikovMH #performance #symmetry

Efficient computation of a reflection symmetry measure for convex polygons based on Minkowski addition (AVT, GLM, HJAMH), pp. 236–240.

HPCA-1995-SterlingSMG #evaluation

An Initial Evaluation of the Convex SPP-1000 for Earth and Space Science Application (TLS, DS, PM, JPG), pp. 176–185.

SAS-1994-HalbwachsPR #approximate #hybrid #linear #verification

Verification of Linear Hybrid Systems by Means of Convex Approximations (NH, YEP, PR), pp. 223–237.

STOC-1993-BergMS #linear

Piecewise linear paths among convex obstacles (MdB, JM, OS), pp. 505–514.

STOC-1993-ChazelleEGGSW #bound #set

Improved bounds on weak epsilon-nets for convex sets (BC, HE, MG, LJG, MS, EW), pp. 495–504.

SAC-1993-MinZ #algorithm

Time-Space Optimal Convex Hull Algorithms (HM, SQZ), pp. 687–693.

ICALP-1990-AltBW #approximate

Approximation of Convex Polygons (HA, JB, HW), pp. 703–716.

STOC-1989-DyerFK #algorithm #approximate #polynomial #random

A Random Polynomial Time Algorithm for Approximating the Volume of Convex Bodies (MED, AMF, RK), pp. 375–381.

STOC-1987-AggarwalGSS #algorithm #diagrams #linear

A Linear Time Algorithm for Computing the Voronoi Diagram of a Convex Polygon (AA, LJG, JBS, PWS), pp. 39–45.

STOC-1987-ChazelleEG #complexity

The Complexity of Cutting Convex Polytopes (BC, HE, LJG), pp. 66–76.

STOC-1986-DobkinEY

Probing Convex Polytopes (DPD, HE, CKY), pp. 424–432.

STOC-1986-KapoorV #algorithm #multi #performance #polynomial #programming

Fast Algorithms for Convex Quadratic Programming and Multicommodity Flows (SK, PMV), pp. 147–159.

STOC-1986-Seidel

Constructing Higher-Dimensional Convex Hulls at Logarithmic Cost per Face (RS), pp. 404–413.

GG-1982-Pfaltz #morphism

Transformation of structures by convex homomorphisms (JLP), pp. 297–313.

STOC-1981-Chazelle

Convex Decompositions of Polyhedra (BC), pp. 70–79.

STOC-1981-KimR

Digital Straightness and Convexity (Extended Abstract) (CEK, AR), pp. 80–89.

STOC-1979-ChazelleD

Decomposing a Polygon into its Convex Parts (BC, DPD), pp. 38–48.

ICALP-1972-Thierrin

Convex Languages (GT), pp. 481–492.