Department of Computer Science
361 – 370 of 1792
- show: 10
- |
- sort: year (new to old)
Close
Embed this list
<iframe src=""
width=""
height=""
allowtransparency="true"
frameborder="0">
</iframe>
- 2021
-
Mark
Layout-Agnostic Order-Batching Optimization
(2021) 12th International Conference on Computational Logistics, ICCL 2021 In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 13004 LNCS. p.115-129
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Communicating Cybersecurity Vulnerability Information: A Producer-Acquirer Case Study
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
JavaDL: Automatically Incrementalizing Java Bug Pattern Detection
(2021) ACM SIGPLAN conference on Systems, Programming, Languages, and Applications: Software for Humanity In Proceedings of the ACM on Programming Languages 5(OOPSLA).
- Contribution to journal › Article
-
Mark
Challenges and Strategies for Managing Requirements Selection in Software Ecosystems
- Contribution to journal › Article
-
Mark
Challenges of Adopting SAFe in the Banking Industry – A Study Two Years After Its Introduction
(2021) 22nd International Conference on Agile Software Development, XP 2021 In Lecture Notes in Business Information Processing 419 LNBIP. p.157-171
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Approximate Counting of k-Paths : Simpler, Deterministic, and in Polynomial Space
- Contribution to journal › Article
-
Mark
Open Data Ecosystems - an empirical investigation into an emerging industry collaboration concept
- Contribution to journal › Article
-
Mark
Clique Is Hard on Average for Regular Resolution
- Contribution to journal › Article
-
Mark
A Precise Framework for Source-Level Control-Flow Analysis
(2021) IEEE 21st International Working Conference on Source Code Analysis and Manipulation (SCAM) p.1-11
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
The fine-grained complexity of computing the tutte polynomial of a linear matroid
(2021) 32nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2021 In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms p.2333-2345
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
