Amanote Research
Register
Sign In
Discover open access scientific publications
Search, annotate, share and cite publications
Publications by Berk Birand
Analyzing the Performance of Greedy Maximal Scheduling via Local Pooling and Graph Theory
Related publications
Iterated Greedy Local Search Methods for Unrelated Parallel Machine Scheduling
European Journal of Operational Research
Information Systems
Simulation
Management Science
Management
Computer Science
Modeling
Operations Research
Performance Limits of Greedy Maximal Matching in Multi-Hop Wireless Networks
Scalability and Performance Improvement of Distributed Sequential Command Governor Strategies via Graph Colorability Theory
IFAC Proceedings Volumes
Around of Modeling Complex Network via Graph Theory
International Journal of Future Generation Communication and Networking
Computer Networks
Communications
Greedy Maximization Framework for Graph-Based Influence Functions
A Greedy Double Swap Heuristic for Nurse Scheduling
Management Science Letters
Accounting
Management
Business
Uncovering Relations Between Traffic Classifiers and Anomaly Detectors via Graph Theory
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Local Pooling Factor of Multihop Wireless Networks
Rearrangements and the Local Integrablility of Maximal Functions
Pacific Journal of Mathematics
Mathematics
