default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMark Velednitsky
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j8]Mark Velednitsky
:
Solving (k-1)-stable instances of k-terminal cut with isolating cuts. J. Comb. Optim. 43(2): 297-311 (2022)- [j7]Mark Velednitsky:
Correction To: Solving (k-1)-stable instances of k-terminal cut with isolating cuts. J. Comb. Optim. 43(3): 697 (2022) - [j6]Mark Velednitsky, Dorit S. Hochbaum:
Isolation branching: a branch and bound algorithm for the k-terminal cut problem. J. Comb. Optim. 44(3): 1659-1679 (2022) - 2020
- [j5]Quico Spaen, Christopher Thraves Caro, Mark Velednitsky:
The Dimension of Valid Distance Drawings of Signed Graphs. Discret. Comput. Geom. 63(1): 158-168 (2020) - [j4]Minjun Chang, Dorit S. Hochbaum, Quico Spaen, Mark Velednitsky:
An Optimally-Competitive Algorithm for Maximum Online Perfect Bipartite Matching with i.i.d. Arrivals. Theory Comput. Syst. 64(4): 645-661 (2020)
2010 – 2019
- 2019
- [c4]Mark Velednitsky:
Solving (k-1)-Stable Instances of k-terminal cut with Isolating Cuts. COCOA 2019: 485-495 - [c3]Dorit S. Hochbaum, Quico Spaen, Mark Velednitsky:
Detecting Aberrant Linking Behavior in Directed Networks. KDIR 2019: 72-82 - 2018
- [c2]Mark Velednitsky, Dorit S. Hochbaum:
Isolation Branching: A Branch and Bound Algorithm for the k-Terminal Cut Problem. COCOA 2018: 624-639 - [c1]Minjun Chang, Dorit S. Hochbaum, Quico Spaen, Mark Velednitsky:
DISPATCH: An Optimally-Competitive Algorithm for Maximum Online Perfect Bipartite Matching with i.i.d. Arrivals. WAOA 2018: 149-164 - [i2]Minjun Chang, Dorit S. Hochbaum, Quico Spaen, Mark Velednitsky:
DISPATCH: An Optimal Algorithm for Online Perfect Bipartite Matching with i.i.d. Arrivals. CoRR abs/1805.02014 (2018) - [i1]Mark Velednitsky:
Short Combinatorial Proof that the DFJ Polytope is contained in the MTZ Polytope for the Asymmetric Traveling Salesman Problem. CoRR abs/1805.06997 (2018) - 2017
- [j3]Kristen Gardner, Mor Harchol-Balter, Alan Scheller-Wolf, Mark Velednitsky, Samuel Zbarsky:
Redundancy-d: The Power of d Choices for Redundancy. Oper. Res. 65(4): 1078-1094 (2017) - [j2]Mark Velednitsky:
Short combinatorial proof that the DFJ polytope is contained in the MTZ polytope for the Asymmetric Traveling Salesman Problem. Oper. Res. Lett. 45(4): 323-324 (2017) - 2016
- [j1]Kristen Gardner, Samuel Zbarsky, Mark Velednitsky, Mor Harchol-Balter, Alan Scheller-Wolf:
Understanding Response Time in the Redundancy-d System. SIGMETRICS Perform. Evaluation Rev. 44(2): 33-35 (2016)
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-05-28 21:36 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:
