I agree that this site is using cookies. You can find further informations
here
.
X
Login
My folder (
0
)
Home
About us
Home About us
Our history
Profile
Press & public relations
Friends
The library in figures
Exhibitions
Projects
Training, internships, careers
Films
Services & Information
Home Services & Information
Lending and interlibrary loans
Returns and renewals
Training and library tours
My Account
Library cards
New to the library?
Download Information
Opening hours
Learning spaces
PC, WLAN, copy, scan and print
Catalogs and collections
Home Catalogs and Collections
Rare books and manuscripts
Digital collections
Subject Areas
Our sites
Home Our sites
Central Library
Law Library (Juridicum)
BB Business and Economics (BB11)
BB Physics and Electrical Engineering
TB Engineering and Social Sciences
TB Economics and Nautical Sciences
TB Music
TB Art & Design
TB Bremerhaven
Contact the library
Home Contact the library
Staff Directory
Open access & publishing
Home Open access & publishing
Reference management: Citavi & RefWorks
Publishing documents
Open Access in Bremen
Show Desktop-Version
Toggle navigation
Beideman, Calvin
12
results:
Search for persons
X
Format
Online (12)
Mediatypes
Articles (Online) (1)
Bookchapter (Online) (1)
OpenAccess-fulltext (10)
Sorted by: Relevance
Sorted by: Year
?
1
Faster Connectivity in Low-Rank Hypergraphs via Expander De..:
, In:
Integer Programming and Combinatorial Optimization; Lecture Notes in Computer Science
,
Beideman, Calvin
;
Chandrasekaran, Karthekeyan
;
Mukhopadhyay, Sagnik
. - p. 70-83 , 2022
Link:
https://doi.org/10.1007/..
?
2
Multicriteria cuts and size-constrained k-cuts in hypergrap..:
Beideman, Calvin
;
Chandrasekaran, Karthekeyan
;
Xu, Chao
Mathematical Programming. 197 (2021) 1 - p. 27-69 , 2021
Link:
https://doi.org/10.1007/..
?
3
Counting and enumerating optimum cut sets for hypergraph $k..:
Beideman, Calvin
;
Chandrasekaran, Karthekeyan
;
Wang, Weihang
http://arxiv.org/abs/2204.09178. , 2022
Link:
http://arxiv.org/abs/220..
?
4
Counting and Enumerating Optimum Cut Sets for Hypergraph k-..:
Beideman, Calvin
;
Chandrasekaran, Karthekeyan
;
Wang, Weihang
doi:10.4230/LIPIcs.ICALP.2022.16. , 2022
Link:
https://doi.org/10.4230/..
?
5
Approximate minimum cuts and their enumeration:
Beideman, Calvin
;
Chandrasekaran, Karthekeyan
;
Wang, Weihang
http://arxiv.org/abs/2211.16747. , 2022
Link:
http://arxiv.org/abs/221..
?
6
Approximate Representation of Symmetric Submodular Function..:
Beideman, Calvin
;
Chandrasekaran, Karthekeyan
;
Chekuri, Chandra
.
doi:10.4230/LIPIcs.FSTTCS.2022.6. , 2022
Link:
https://doi.org/10.4230/..
?
7
Deterministic enumeration of all minimum cut-sets and $k$-c..:
Beideman, Calvin
;
Chandrasekaran, Karthekeyan
;
Wang, Weihang
http://arxiv.org/abs/2110.14815. , 2021
Link:
http://arxiv.org/abs/211..
?
8
Faster connectivity in low-rank hypergraphs via expander de..:
Beideman, Calvin
;
Chandrasekaran, Karthekeyan
;
Mukhopadhyay, Sagnik
.
http://arxiv.org/abs/2011.08097. , 2020
Link:
http://arxiv.org/abs/201..
?
9
Multicriteria Cuts and Size-Constrained k-Cuts in Hypergrap..:
Beideman, Calvin
;
Chandrasekaran, Karthekeyan
;
Xu, Chao
doi:10.4230/LIPIcs.APPROX/RANDOM.2020.17. , 2020
Link:
https://doi.org/10.4230/..
?
10
Multicritera Cuts and Size-Constrained $k$-cuts in Hypergra..:
Beideman, Calvin
;
Chandrasekaran, Karthekeyan
;
Xu, Chao
http://arxiv.org/abs/2006.11589. , 2020
Link:
http://arxiv.org/abs/200..
?
11
The Sprague-Grundy function for some selective compound gam..:
Beideman, Calvin
;
Bowen, Matthew
;
Muyesser, Necati Alp
http://arxiv.org/abs/1802.08700. , 2018
Link:
http://arxiv.org/abs/180..
?
12
Set Families with Low Pairwise Intersection:
Beideman, Calvin
;
Blocki, Jeremiah
http://arxiv.org/abs/1404.4622. , 2014
Link:
http://arxiv.org/abs/140..
1-12