default search action
Ian Post
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [c11]Sina Dezfuli, Zachary Friggstad, Ian Post, Chaitanya Swamy:
Combinatorial Algorithms for Rooted Prize-Collecting Walks and Applications to Orienteering and Minimum-Latency Problems. IPCO 2022: 195-209 - 2021
- [i10]Sina Dezfuli, Zachary Friggstad, Ian Post, Chaitanya Swamy:
Combinatorial Algorithms for Rooted Prize-Collecting Walks and Applications to Orienteering and Minimum-Latency Problems. CoRR abs/2111.07414 (2021)
2010 – 2019
- 2018
- [j4]Andreas Emil Feldmann
, Wai Shing Fung, Jochen Könemann, Ian Post:
A (1+ε)-Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs. SIAM J. Comput. 47(4): 1667-1704 (2018) - 2015
- [j3]Ian Post, Yinyu Ye:
The Simplex Method is Strongly Polynomial for Deterministic Markov Decision Processes. Math. Oper. Res. 40(4): 859-868 (2015) - [c10]Andreas Emil Feldmann
A (1+ε)-Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs. ICALP (1) 2015: 469-480 - [c9]Ian Post, Chaitanya Swamy:
Linear Programming-based Approximation Algorithms for Multi-Vehicle Minimum Latency Problems (Extended Abstract). SODA 2015: 512-531 - [i9]Andreas Emil Feldmann, Wai Shing Fung, Jochen Könemann, Ian Post:
A (1 + ε)-Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs. CoRR abs/1502.04588 (2015) - 2014
- [i8]Ian Post, Chaitanya Swamy:
Linear-Programming based Approximation Algorithms for Multi-Vehicle Minimum Latency Problems. CoRR abs/1411.4573 (2014) - 2013
- [c8]Michael Kapralov
Online Submodular Welfare Maximization: Greedy is Optimal. SODA 2013: 1216-1225 - [c7]Ian Post, Yinyu Ye:
The simplex method is strongly polynomial for deterministic Markov decision processes. SODA 2013: 1465-1473 - 2012
- [b1]Ian Post:
Some applications of duality and flows : algorithms for network design and deterministic Markov decision processes. Stanford University, USA, 2012 - [j2]Ashish Goel, Ian Post:
One Tree Suffices: A Simultaneous O(1)-Approximation for Single-Sink Buy-at-Bulk. Theory Comput. 8(1): 351-368 (2012) - [c6]Debojyoti Dutta, Michael Kapralov, Ian Post, Rajendra Shinde:
Embedding Paths into Trees: VM Placement to Minimize Congestion. ESA 2012: 431-442 - [i7]Debojyoti Dutta, Michael Kapralov, Ian Post, Rajendra Shinde:
Optimal bandwidth-aware VM allocation for Infrastructure-as-a-Service. CoRR abs/1202.3683 (2012) - [i6]Ashish Goel, Michael Kapralov, Ian Post:
Single pass sparsification in the streaming model with edge deletions. CoRR abs/1203.4900 (2012) - [i5]Mikhail Kapralov, Ian Post, Jan Vondrák:
Online and stochastic variants of welfare maximization. CoRR abs/1204.1025 (2012) - [i4]Ian Post, Yinyu Ye:
The simplex method is strongly polynomial for deterministic Markov decision processes. CoRR abs/1208.5083 (2012) - 2011
- [c5]Pranav Dandekar, Ashish Goel, Ramesh Govindan, Ian Post:
Liquidity in credit networks: a little trust goes a long way. EC 2011: 147-156 - 2010
- [c4]Ashish Goel, Ian Post:
One Tree Suffices: A Simultaneous O(1)-Approximation for Single-Sink Buy-at-Bulk. FOCS 2010: 593-600 - [c3]Pranav Dandekar, Ashish Goel, Ramesh Govindan, Ian Post:
Liquidity in Credit Networks: A Little Trust Goes a Long Way. NetEcon 2010: 1:1 - [i3]Ashish Goel, Ian Post:
One Tree Suffices: A Simultaneous O(1)-Approximation for Single-Sink Buy-at-Bulk. CoRR abs/1004.2291 (2010) - [i2]Pranav Dandekar, Ashish Goel, Ramesh Govindan, Ian Post:
Liquidity in Credit Networks: A Little Trust Goes a Long Way. CoRR abs/1007.0515 (2010)
2000 – 2009
- 2009
- [c2]Ashish Goel, Ian Post:
An Oblivious O(1)-Approximation for Single Source Buy-at-Bulk. FOCS 2009: 442-450 - [i1]Ashish Goel, Ian Post:
An Oblivious O(1)-Approximation for Single Source Buy-at-Bulk. CoRR abs/0908.3740 (2009) - 2008
- [j1]Yih Wang
A 1.1 GHz 12 µA/Mb-Leakage SRAM Design in 65 nm Ultra-Low-Power CMOS Technology With Integrated Leakage Reduction for Mobile Applications. IEEE J. Solid State Circuits 43(1): 172-179 (2008) - 2007
- [c1]Yih Wang, Hong Jo Ahn, Uddalak Bhattacharya, Tom Coan, Fatih Hamzaoglu, Walid M. Hafez, Chia-Hong Jan, Pramod Kolar, Sarvesh H. Kulkarni, Jie-Feng Lin, Yong-Gee Ng, Ian Post, Liqiong Wei, Yih Zhang, Kevin Zhang, Mark Bohr:
A 1.1GHz 12μA/Mb-Leakage SRAM Design in 65nm Ultra-Low-Power CMOS with Integrated Leakage Reduction for Mobile Applications. ISSCC 2007: 324-606
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:15 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: