研究兴趣

论文共 184 篇作者统计合作学者相似作者

按年份排序按引用量排序主题筛选期刊级别筛选合作者筛选合作机构筛选
时间
引用量
主题
期刊级别
合作者
合作机构
Preexisting Depression and Daytime Sleepiness in Women and Men
Irene Gonsalvez,Jason J Li, Courtney Stevens, Justin A Chen, Cindy H Liu
BEHAVIORAL SLEEP MEDICINE（2022）
引用0浏览0WOS引用
0
0
加载更多
作者统计
  • 合作者
  • 学生
  • 导师
暂无相似学者，你可以通过学者研究领域进行搜索筛选
数据免责声明
页面数据均来自互联网公开来源、合作出版商和通过AI技术自动分析结果，我们不对页面数据的有效性、准确性、正确性、可靠性、完整性和及时性做出任何承诺和保证。若有疑问，可以通过电子邮件方式联系我们：report@aminer.cn
s metric on $V'$. A major open question in the area of metric embeddings is the existence of $O(1)$ multiplicative distortion SPR solutions for every (non-trivial) minor-closed family of graphs. To this end prior work has studied SPR on trees, cactus and outerplanar graphs and showed that in these graphs such a minor exists with $O(1)$ distortion. We give $O(1)$ distortion SPR solutions for series-parallel graphs, extending the frontier of this line of work. The main engine of our approach is a new metric decomposition for series-parallel graphs which we call a hammock decomposition. Roughly, a hammock decomposition is a forest-like structure that preserves certain critical parts of the metric induced by a series-parallel graph. ","authors":[{"id":"618177748672f199e5d95512","name":"D Ellis Hershkowitz"},{"id":"5408d6dcdabfae450f4467ff","name":"Jason Li"}],"create_time":"2021-04-05T13:35:19.379Z","doi":"10.4230\u002FLIPICS.ESA.2022.66","hashs":{"h1":"1sprs","h3":"g"},"id":"606ad42691e011f23f9095ad","num_citation":0,"pages":{"end":"66:17","start":"66:1"},"pdf_src":["https:\u002F\u002Farxiv.org\u002Fpdf\u002F2104.00750"],"title":"O(1) Steiner Point Removal in Series-Parallel Graphs","update_times":{"u_a_t":"2022-10-19T14:35:08.454Z","u_c_t":"2023-03-29T09:25:05.991Z","u_v_t":"2023-04-16T19:45:35.729Z"},"urls":["https:\u002F\u002Fdoi.org\u002F10.4230\u002FLIPIcs.ESA.2022.66","db\u002Fjournals\u002Fcorr\u002Fcorr2104.html#abs-2104-00750","https:\u002F\u002Farxiv.org\u002Fabs\u002F2104.00750","https:\u002F\u002Fdblp.org\u002Frec\u002Fconf\u002Fesa\u002FHershkowitzL22"],"venue":{"info":{"name":"European Symposium on Algorithms (ESA)","name_s":"ESA"},"volume":"abs\u002F2104.00750"},"venue_hhb_id":"5ea1c954edb6e7d53c00f0a1","versions":[{"id":"606ad42691e011f23f9095ad","sid":"2104.00750","src":"arxiv","year":2021},{"id":"634d809190e50fcafd4e5f73","sid":"conf\u002Fesa\u002FHershkowitzL22","src":"dblp","vsid":"conf\u002Fesa","year":2022},{"id":"64564796d68f896efae2d4fe","sid":"journals\u002Fcorr\u002Fabs-2104-00750","src":"dblp","year":2021}],"year":2022},{"abstract":"We give an O (m)-time algorithm for the edge connectivity augmentation problem and the closely related edge splitting-off problem. This is optimal up to lower order terms and closes the long line of work on these problems.","authors":[{"email":"ruoxu.cen@duke.edu","id":"637284e3ec88d95668cf0a27","name":"Ruoxu Cen","org":"Duke Univ, Dept Comp Sci, Durham, NC 27706 USA","orgid":"62331e330a6eb147dca8a719","orgs":["Duke Univ, Dept Comp Sci, Durham, NC 27706 USA"]},{"email":"jmli@cs.cmu.edu","id":"5408d6dcdabfae450f4467ff","name":"Jason Li","org":"Univ Calif Berkeley, Simons Inst Theory Comp, Berkeley, CA 94720 USA","orgs":["Univ Calif Berkeley, Simons Inst Theory Comp, Berkeley, CA 94720 USA"]},{"email":"debmalya@cs.duke.edu","id":"53f464a3dabfaeee22a4d0b4","name":"Debmalya Panigrahi","org":"Duke Univ, Dept Comp Sci, Durham, NC 27706 USA","orgid":"62331e330a6eb147dca8a719","orgs":["Duke Univ, Dept Comp Sci, Durham, NC 27706 USA"]}],"citations":{"google_citation":1,"last_citation":1},"create_time":"2022-05-11T13:45:13.286Z","doi":"10.1145\u002F3519935.3520038","hashs":{"h1":"ecant"},"id":"627b29bb5aee126c0f0fe6e2","issn":"0737-8017","keywords":["connectivity augmentation"," splitting off"," extreme sets"," minimu cuts"],"lang":"en","num_citation":2,"pages":{"end":"150","start":"137"},"pdf":"https:\u002F\u002Fcz5waila03cyo0tux1owpyofgoryroob.oss-cn-beijing.aliyuncs.com\u002F30\u002FA9\u002FE6\u002F30A9E667C124526A8D1A240ACC6CCDDB.pdf","pdf_src":["https:\u002F\u002Farxiv.org\u002Fpdf\u002F2205.04636"],"title":"Edge Connectivity Augmentation in Near-Linear Time","update_times":{"u_a_t":"2022-10-19T11:29:47.005Z","u_c_t":"2023-04-07T15:09:24.347Z","u_v_t":"2023-04-16T18:36:07.905Z"},"urls":["https:\u002F\u002Fdoi.org\u002F10.1145\u002F3519935.3520038","https:\u002F\u002Fdblp.org\u002Frec\u002Fconf\u002Fstoc\u002FCenLP22","https:\u002F\u002Farxiv.org\u002Fabs\u002F2205.04636","http:\u002F\u002Fwww.webofknowledge.com\u002F"],"venue":{"info":{"name":"PROCEEDINGS OF THE 54TH ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING (STOC '22)"}},"venue_hhb_id":"5ea1b7ecedb6e7d53c00cc51","versions":[{"id":"627b29bb5aee126c0f0fe6e2","sid":"2205.04636","src":"arxiv","year":2022},{"id":"634d805d90e50fcafd4e17f2","sid":"conf\u002Fstoc\u002FCenLP22","src":"dblp","vsid":"conf\u002Fstoc","year":2022},{"id":"6352726690e50fcafd934d81","sid":"WOS:000852709400013","src":"wos","vsid":"PROCEEDINGS OF THE 54TH ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING (STOC '22)","year":2022}],"year":2022},{"abstract":"In the Feedback Vertex Set problem, one is given an undirected graph G and an integer k , and one needs to determine whether there exists a set of k vertices that intersects all cycles of G (a so-called feedback vertex set). Feedback Vertex Set is one of the most central problems in parameterized complexity: It served as an excellent test bed for many important algorithmic techniques in the field such as Iterative Compression [Guo et al. (JCSS’06)], Randomized Branching [Becker et al. (J. Artif. Intell. Res’00)] and Cut&Count [Cygan et al. (FOCS’11)]. In particular, there has been a long race for the smallest dependence f ( k ) in run times of the type O ⋆ ( f ( k )), where the O ⋆ notation omits factors polynomial in n . This race seemed to have reached a conclusion in 2011, when a randomized O ⋆ (3 k ) time algorithm based on Cut&Count was introduced. In this work, we show the contrary and give a O ⋆ (2.7 k ) time randomized algorithm. Our algorithm combines all mentioned techniques with substantial new ideas: First, we show that, given a feedback vertex set of size k of bounded average degree, a tree decomposition of width (1 − Ω (1)) k can be found in polynomial time. Second, we give a randomized branching strategy inspired by the one from [Becker et al. (J. Artif. Intell. Res’00)] to reduce to the aforementioned bounded average degree setting. Third, we obtain significant run time improvements by employing fast matrix multiplication.","authors":[{"id":"5408d6dcdabfae450f4467ff","name":"Jason Li","org":"Carnegie Mellon University","orgid":"5f71b2861c455f439fe3c771","orgs":["Carnegie Mellon University"]},{"id":"53f390f2dabfae4b34a547c0","name":"Jesper Nederlof","org":"Utrecht University, The Netherlands","orgid":"5f71b2841c455f439fe3c6c2","orgs":["Utrecht University, The Netherlands"]}],"create_time":"2023-01-28T22:30:09.326Z","doi":"10.1145\u002F3504027","hashs":{"h1":"dfvss","h3":"[27t"},"id":"623006aa5aee126c0fa268ad","issn":"1549-6325","num_citation":0,"pages":{"end":"34:26","start":"34:1"},"title":"Detecting Feedback Vertex Sets of Size in (2.7) Time.","update_times":{"u_a_t":"2023-01-30T23:07:09.204Z","u_c_t":"2023-03-29T11:31:09.169Z","u_v_t":"2023-01-30T20:24:12.321Z"},"urls":["https:\u002F\u002Fdl.acm.org\u002Fdoi\u002F10.1145\u002F3504027","http:\u002F\u002Fdx.doi.org\u002F10.1145\u002F3504027","db\u002Fjournals\u002Ftalg\u002Ftalg18.html#LiN22","https:\u002F\u002Fdoi.org\u002F10.1145\u002F3504027"],"venue":{"info":{"name":"ACM Trans. Algorithms"},"issue":"4","volume":"18"},"venue_hhb_id":"5ea17f53edb6e7d53c0093c5","versions":[{"id":"623006aa5aee126c0fa268ad","sid":"10.1145\u002F3504027","src":"crossref"},{"id":"6282513a5aee126c0fdc97f3","sid":"W4212964627","src":"openalex"},{"id":"63d7ae9d90e50fcafdae16eb","sid":"journals\u002Ftalg\u002FLiN22","src":"dblp","vsid":"journals\u002Ftalg","year":2022},{"id":"63aa966190e50fcafd009655","sid":"10.1145\u002F3504027","src":"acm","year":2022}],"year":2022},{"abstract":"We show how to round any half-integral solution to the subtour-elimination relaxation for the TSP, while losing a less-than-1.5 factor. Such a rounding algorithm was recently given by Karlin, Klein, and Oveis Gharan based on sampling from max-entropy distributions. We build on an approach of Haddadan and Newman to show how sampling from the matroid intersection polytope, and a new use of max-entropy sampling, can give better guarantees.","authors":[{"id":"53f442b4dabfaeb22f4b249d","name":"Anupam Gupta","org":"Carnegie Mellon University","orgid":"5f71b2861c455f439fe3c771","orgs":["Carnegie Mellon University"]},{"id":"615581829e795e604ab3a692","name":"Euiwoong Lee","org":"University of Michigan","orgid":"5f71b35f1c455f439fe4267b","orgs":["University of Michigan"]},{"id":"5408d6dcdabfae450f4467ff","name":"Jason Li","org":"Simons Institute for the Theory of Computing and UC Berkeley","orgs":["Simons Institute for the Theory of Computing and UC Berkeley"]},{"id":"53f45453dabfaee02ad51113","name":"Marcin Mucha","org":"University of Warsaw","orgid":"5f71b3e51c455f439fe461b7","orgs":["University of Warsaw"]},{"email":"hanewman@andrew.cmu.edu","name":"Heather Newman","org":"Carnegie Mellon University","orgid":"5f71b2861c455f439fe3c771","orgs":["Carnegie Mellon University"]},{"name":"Sherry Sarkar","org":"Carnegie Mellon University","orgid":"5f71b2861c455f439fe3c771","orgs":["Carnegie Mellon University"]}],"create_time":"2021-11-19T13:46:06.717Z","doi":"10.1007\u002F978-3-031-06901-7_23","flags":[{"flag":"affirm_author","person_id":"53f442b4dabfaeb22f4b249d"},{"flag":"affirm_author","person_id":"53f442b4dabfaeb22f4b249d"}],"hashs":{"h1":"mtrhs"},"id":"619715f95244ab9dcb185425","issn":"0302-9743","lang":"en","num_citation":4,"pages":{"end":"318","start":"305"},"pdf":"https:\u002F\u002Fstatic.aminer.cn\u002Fstorage\u002Fpdf\u002Farxiv\u002F21\u002F2111\u002F2111.09290.pdf","pdf_src":["https:\u002F\u002Farxiv.org\u002Fpdf\u002F2111.09290"],"title":"Matroid-Based TSP Rounding for Half-Integral Solutions","update_times":{"u_a_t":"2022-10-19T18:02:58.966Z","u_c_t":"2023-03-29T10:48:42.796Z","u_v_t":"2023-04-16T20:58:30.951Z"},"urls":["db\u002Fjournals\u002Fcorr\u002Fcorr2111.html#abs-2111-09290","https:\u002F\u002Farxiv.org\u002Fabs\u002F2111.09290","https:\u002F\u002Flink.springer.com\u002Fchapter\u002F10.1007\u002F978-3-031-06901-7_23","https:\u002F\u002Fsemanticscholar.org\u002Fpaper\u002F7bf37a46e8007b5895577691554825e6e3c741a5","http:\u002F\u002Fwww.webofknowledge.com\u002F","https:\u002F\u002Fdblp.org\u002Frec\u002Fconf\u002Fipco\u002FGuptaLLMNS22","https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-031-06901-7_23"],"venue":{"info":{"name":"Integer Programming and Combinatorial Optimization","name_s":"IPCO"},"name":"International Conference on Integer Programming and Combinatorial Optimization","volume":"13265"},"venue_hhb_id":"5ea1daecedb6e7d53c010976","versions":[{"id":"619715f95244ab9dcb185425","sid":"2111.09290","src":"arxiv","year":2021},{"id":"63385cfd90e50fcafd5d39ce","sid":"10.1007\u002F978-3-031-06901-7_23","src":"springer","vsid":"ipco, ipco","year":2022},{"id":"634d80d790e50fcafd4ec8c9","sid":"conf\u002Fipco\u002FGuptaLLMNS22","src":"dblp","vsid":"conf\u002Fipco","year":2022},{"id":"63730f8590e50fcafd429d09","sid":"WOS:000870458800021","src":"wos","vsid":"INTEGER PROGRAMMING AND COMBINATORIAL OPTIMIZATION, IPCO 2022","year":2022},{"id":"61c9e0565244ab9dcb7bf23b","sid":"7bf37a46e8007b5895577691554825e6e3c741a5","src":"semanticscholar"},{"id":"645647a2d68f896efae32b69","sid":"journals\u002Fcorr\u002Fabs-2111-09290","src":"dblp","year":2021}],"year":2022},{"authors":[{"email":"jason_li@hms.harvard.edu","id":"5408d6dcdabfae450f4467ff","name":"Jason J. Li","org":"Harvard Med Sch, Boston, MA 02115 USA","orgs":["Harvard Med Sch, Boston, MA 02115 USA"]},{"name":"Kanika Kamal"},{"name":"Hyeouk Chris Hahm"},{"name":"Cindy H. Liu"}],"create_time":"2023-02-03T20:06:21.624Z","doi":"10.1016\u002Fj.jaac.2022.09.389","hashs":{"h1":"picgp","h2":"s","h3":"gmsya"},"id":"63bfe99290e50fcafd68cd07","issn":"0890-8567","num_citation":0,"pages":{"end":"S264","start":"S264"},"title":"Psychiatric impacts of the covid-19 global pandemic on us sexual and gender minority (sgm) young adults","update_times":{"u_c_t":"2023-04-24T15:35:29.768Z","u_v_t":"2023-04-20T13:18:08.583Z"},"urls":["http:\u002F\u002Fwww.webofknowledge.com\u002F"],"venue":{"info":{"name":"JOURNAL OF THE AMERICAN ACADEMY OF CHILD AND ADOLESCENT PSYCHIATRY"},"issue":"10","volume":"61"},"venue_hhb_id":"5ea65791edb6e7d53c04541a","versions":[{"id":"63bfe99290e50fcafd68cd07","sid":"WOS:000873567901234","src":"wos"}],"year":2022}],"profilePubsTotal":184,"profilePatentsPage":0,"profilePatents":null,"profilePatentsTotal":null,"profilePatentsEnd":false,"profileProjectsPage":0,"profileProjects":null,"profileProjectsTotal":null,"newInfo":null,"checkDelPubs":[]}};