|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 163 occurrences of 117 keywords
|
|
|
Results
Found 432 publication records. Showing 432 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
96 | Amos Korman, David Peleg |
Compact separator decompositions in dynamic trees and applications to labeling schemes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Distributed Comput. ![In: Distributed Comput. 21(2), pp. 141-161, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Informative labeling schemes, Distributed algorithms, Dynamic networks, Graph decompositions, Routing schemes |
96 | Amos Korman, David Peleg |
Compact Separator Decompositions in Dynamic Trees and Applications to Labeling Schemes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DISC ![In: Distributed Computing, 21st International Symposium, DISC 2007, Lemesos, Cyprus, September 24-26, 2007, Proceedings, pp. 313-327, 2007, Springer, 978-3-540-75141-0. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
informative labeling schemes, Distributed algorithms, dynamic networks, graph decompositions, routing schemes |
94 | Hristo N. Djidjev, John R. Gilbert |
Separators in Graphs with Negative and Multiple Vertex Weights. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 23(1), pp. 57-71, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
Graph algorithms, Cutset, Graph separator, Divide-and-conquer algorithm, Separator theorem |
91 | Uriel Feige, Mohammad Mahdian |
Finding small balanced separators. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, Seattle, WA, USA, May 21-23, 2006, pp. 375-384, 2006, ACM, 1-59593-134-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
fixed parameter tractability, VC dimension |
84 | Bin Fu, Sorinel Adrian Oprisan, Lizhe Xu |
Multi-directional Width-Bounded Geometric Separator and Protein Folding. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 16th International Symposium, ISAAC 2005, Sanya, Hainan, China, December 19-21, 2005, Proceedings, pp. 995-1006, 2005, Springer, 3-540-30935-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
78 | Young June Pyun, Douglas S. Reeves |
Strategic deployment of network monitors for attack attribution. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BROADNETS ![In: Fourth International Conference on Broadband Communications, Networks and Systems, (BROADNETS 2007), 10-14 September 2007, Raleigh, North-Carolina, USA, pp. 525-534, 2007, IEEE, 978-1-4244-1432-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
71 | Henning Fernau |
Graph Separator Algorithms: A Refined Analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 28th International Workshop, WG 2002, Cesky Krumlov, Czech Republic, June 13-15, 2002, Revised Papers, pp. 186-197, 2002, Springer, 3-540-00331-2. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
71 | Viet Hai Nguyen |
A New Staircase Separator Theorem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Euro-Par ![In: Euro-Par '97 Parallel Processing, Third International Euro-Par Conference, Passau, Germany, August 26-29, 1997, Proceedings, pp. 450-457, 1997, Springer, 3-540-63440-1. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
65 | Ekkehard Köhler, Rolf H. Möhring, Heiko Schilling |
Acceleration of Shortest Path and Constrained Shortest Path Computation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WEA ![In: Experimental and Efficient Algorithms, 4th InternationalWorkshop, WEA 2005, Santorini Island, Greece, May 10-13, 2005, Proceedings, pp. 126-138, 2005, Springer, 3-540-25920-1. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
58 | Bin Fu |
Theory and Application of Width Bounded Geometric Separator. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, Marseille, France, February 23-25, 2006, Proceedings, pp. 277-288, 2006, Springer, 978-3-540-32301-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
58 | Martin Holzer 0001, Grigorios Prasinos, Frank Schulz 0001, Dorothea Wagner, Christos D. Zaroliagis |
Engineering Planar Separator Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2005, 13th Annual European Symposium, Palma de Mallorca, Spain, October 3-6, 2005, Proceedings, pp. 628-639, 2005, Springer, 3-540-29118-0. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
52 | David Eppstein, Gary L. Miller, Shang-Hua Teng |
A Deterministic Linear Time Algorithm for Geometric Separators and its Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the Ninth Annual Symposium on Computational GeometrySan Diego, CA, USA, May 19-21, 1993, pp. 99-108, 1993, ACM, 0-89791-582-8. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
47 | Bin Fu, Zhixiang Chen 0001 |
Sublinear time width-bounded separators and their application to the protein side-chain packing problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 15(4), pp. 387-407, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Width-bounded separator, Random sampling, Sublinear time algorithm |
47 | Michelangelo Grigni |
Approximate TSP in Graphs with Forbidden Minors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 27th International Colloquium, ICALP 2000, Geneva, Switzerland, July 9-15, 2000, Proceedings, pp. 869-877, 2000, Springer, 3-540-67715-1. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
TSP, separator, spanner, approximation scheme, graph minor, genus |
47 | Anne Berry, Jean Paul Bordat, Olivier Cogis |
Generating All the Minimal Separators of a Graph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 25th International Workshop, WG '99, Ascona, Switzerland, June 17-19, 1999, Proceedings, pp. 167-172, 1999, Springer, 3-540-66731-8. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
Minimal Separator, Graph, Enumeration Algorithm |
45 | Egon Balas, Cid C. de Souza |
The vertex separator problem: a polyhedral investigation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 103(3), pp. 583-608, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
45 | Andreas Brandstädt, Van Bang Le, Suhail Mahfud |
New Applications of Clique Separator Decomposition for the Maximum Weight Stable Set Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory, 15th International Symposium, FCT 2005, Lübeck, Germany, August 17-20, 2005, Proceedings, pp. 516-527, 2005, Springer, 3-540-28193-2. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
45 | Zhi Lin Zhang, Yi Shen 0001, Yan Wang 0047 |
Measure and DMC control of battery separator thickness uniformity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICARCV ![In: 8th International Conference on Control, Automation, Robotics and Vision, ICARCV 2004, Kunming, China, 6-9 December 2004, Proceedings, pp. 851-854, 2004, IEEE, 0-7803-8653-1. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
45 | Wei Li 0002, Peter van Beek |
Guiding Real-World SAT Solving with Dynamic Hypergraph Separator Decomposition. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICTAI ![In: 16th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2004), 15-17 November 2004, Boca Raton, FL, USA, pp. 542-548, 2004, IEEE Computer Society, 0-7695-2236-X. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
45 | Yutaka Tamiya |
Performance optimization using separator sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCAD ![In: Proceedings of the 1999 IEEE/ACM International Conference on Computer-Aided Design, 1999, San Jose, California, USA, November 7-11, 1999, pp. 191-194, 1999, IEEE Computer Society, 0-7803-5832-5. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
42 | Eyal Amir, Robert Krauthgamer, Satish Rao |
Constant factor approximation of vertex-cuts in planar graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 35th Annual ACM Symposium on Theory of Computing, June 9-11, 2003, San Diego, CA, USA, pp. 90-99, 2003, ACM, 1-58113-674-9. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
balanced cut, planar separator, quotient cut, vertex separator, approximation algorithms, planar graph |
40 | Naveen Garg 0001, Huzur Saran, Vijay V. Vazirani |
Finding separator cuts in planar graphs within twice the optimal ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 35th Annual Symposium on Foundations of Computer Science, Santa Fe, New Mexico, USA, 20-22 November 1994, pp. 14-23, 1994, IEEE Computer Society, 0-8186-6580-7. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
separator cuts, factor 2 approximation algorithm, minimum cost b-balanced cut, psuedo-approximation algorithm, binary vertex weights, planar graphs, VLSI design, vertex weights |
39 | Victor Boyarshinov, Malik Magdon-Ismail |
Efficient Optimal Linear Boosting of a Pair of Classifiers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Neural Networks ![In: IEEE Trans. Neural Networks 18(2), pp. 317-328, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
39 | Lyudmil Aleksandrov, Hristo N. Djidjev, Hua Guo, Anil Maheshwari |
Partitioning planar graphs with costs and weights. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM J. Exp. Algorithmics ![In: ACM J. Exp. Algorithmics 11, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
graph partitioning algorithms, implementation, Graph algorithms, graph separators |
39 | David Steurer |
Tight bounds for the Min-Max boundary decomposition cost of weighted graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPAA ![In: SPAA 2006: Proceedings of the 18th Annual ACM Symposium on Parallelism in Algorithms and Architectures, Cambridge, Massachusetts, USA, July 30 - August 2, 2006, pp. 197-206, 2006, ACM, 1-59593-452-9. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
scheduling, load balancing, parallel computing, graph partitioning, graph separators |
39 | Bin Fu, Wei Wang 0051 |
A 2O(n1-(1/d)log n) Time Algorithm for d-Dimensional Protein Folding in the HP-Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming: 31st International Colloquium, ICALP 2004, Turku, Finland, July 12-16, 2004. Proceedings, pp. 630-644, 2004, Springer, 3-540-22849-7. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
39 | Lyudmil Aleksandrov, Hristo N. Djidjev, Hua Guo, Anil Maheshwari |
Partitioning Planar Graphs with Costs and Weights. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALENEX ![In: Algorithm Engineering and Experiments, 4th International Workshop, ALENEX 2002, San Francisco, CA, USA, January 4-5, 2002, Revised Papers, pp. 98-110, 2002, Springer, 3-540-43977-3. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
39 | John H. Reif |
Efficient Parallel Computation of the Characteristic Polynomial of a Sparse, Separable Matrix. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 29(3), pp. 487-510, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
Nested Dissection, Parallel algorithms, Characteristic polynomial, Sparse linear systems |
39 | Gary L. Miller, Shang-Hua Teng, William P. Thurston, Stephen A. Vavasis |
Separators for sphere-packings and nearest neighbor graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 44(1), pp. 1-29, 1997. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
centerpoint, rndomized algorithm, sphere-preserving mapping, computational geometry, partitioning, graph algorithms, probabilistic method, point location, graph separators |
38 | Michael J. Breza, Laksh Bhatia, Ivana Tomic, Anqi Fu, Waqas Ikram, Valentinos Kongezos, Julie A. McCann |
The Separator, a Two-Phase Oil and Water Gravity CPS Separator Testbed. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2002.00945, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
34 | Rohit Khandekar, Satish Rao, Umesh V. Vazirani |
Graph partitioning using single commodity flows. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 56(4), pp. 19:1-19:15, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Edge-separator, single commodity max-flow, sparse cut, spectral method |
34 | Sanjeev Arora, Satyen Kale |
A combinatorial, primal-dual approach to semidefinite programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 39th Annual ACM Symposium on Theory of Computing, San Diego, California, USA, June 11-13, 2007, pp. 227-236, 2007, ACM, 978-1-59593-631-8. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
balanced separator, matrix multiplicative weights, min UnCut, semidefinite programming, sparsest cut |
34 | Zhixiang Chen 0001, Bin Fu, Yong Tang 0001, Binhai Zhu |
A PTAS for a disc covering problem using width-bounded separators. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 11(2), pp. 203-217, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Width-bounded separator, Disc covering, Approximation algorithms, Randomized algorithms |
34 | Ittai Abraham, Cyril Gavoille |
Object location using path separators. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: Proceedings of the Twenty-Fifth Annual ACM Symposium on Principles of Distributed Computing, PODC 2006, Denver, CO, USA, July 23-26, 2006, pp. 188-197, 2006, ACM, 1-59593-384-0. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
excluded minor, separator, compact routing |
34 | Rohit Khandekar, Satish Rao, Umesh V. Vazirani |
Graph partitioning using single commodity flows. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, Seattle, WA, USA, May 21-23, 2006, pp. 385-390, 2006, ACM, 1-59593-134-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
edge-separator, single commodity max-flow, sparse cut, spectral method |
34 | Mohammod Abul Kashem, M. Ziaur Rahman |
An Optimal Parallel Algorithm for c-Vertex-Ranking of Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 14th International Symposium, ISAAC 2003, Kyoto, Japan, December 15-17, 2003, Proceedings, pp. 464-473, 2003, Springer, 3-540-20695-7. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
Ordered coloring, Separator-tree, Vertex-ranking, Parallel algorithm, Tree |
34 | Xiao Zhou 0001, Mohammod Abul Kashem, Takao Nishizeki |
Generalized Edge-Ranking of Trees (Extended Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 22nd International Workshop, WG '96, Cadenabbia (Como), Italy, June 12-14, 1996, Proceedings, pp. 390-404, 1996, Springer, 3-540-62559-3. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
Edge-ranking, Separator tree, Algorithm, Tree |
34 | Antonie Azokly, Rolf Ingold |
A language for document generic layout description and its use for segmentation into regions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDAR ![In: Third International Conference on Document Analysis and Recognition, ICDAR 1995, August 14 - 15, 1995, Montreal, Canada. Volume II, pp. 1123-1126, 1995, IEEE Computer Society. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
document generic layout description language, generic layout description, region boundary delimiters, separator determination, segmentation method, page description languages |
32 | Victor F. Cavalcante, Cid C. de Souza |
Lagrangian Relaxation and Cutting Planes for the Vertex Separator Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESCAPE ![In: Combinatorics, Algorithms, Probabilistic and Experimental Methodologies, First International Symposium, ESCAPE 2007, Hangzhou, China, April 7-9, 2007, Revised Selected Papers, pp. 471-482, 2007, Springer, 978-3-540-74449-8. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
32 | Yuan Lin, Hongyan Liu 0002 |
Separator: Sifting Hierarchical Heavy Hitters Accurately from Data Streams. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ADMA ![In: Advanced Data Mining and Applications, Third International Conference, ADMA 2007, Harbin, China, August 6-8, 2007, Proceedings, pp. 170-182, 2007, Springer, 978-3-540-73870-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
hierarchical heavy hitters, algorithms, data stream mining |
32 | Matthias Kriesell |
Closed Separator Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 25(5), pp. 575-598, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000): 05C40 |
32 | Cid C. de Souza, Egon Balas |
The vertex separator problem: algorithms and computations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 103(3), pp. 609-631, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
26 | Jianer Chen, Yang Liu 0002, Songjian Lu |
An Improved Parameterized Algorithm for the Minimum Node Multiway Cut Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 55(1), pp. 1-13, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Multiway cut problem, Network flow, Fixed-parameter tractability, Minimum cut, Parameterized algorithm |
26 | Mohammad Abdollahpouri, Ali Khaki-Sedigh, Hamid Khaloozadeh |
A New Method for Active Noise Cancellation in the Presence of Three Unknown Moving Sources. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Asia International Conference on Modelling and Simulation ![In: Second Asia International Conference on Modelling and Simulation, AMS 2008, Kuala Lumpur, Malaysia, May 13-15, 2008, pp. 1006-1011, 2008, IEEE Computer Society, 978-0-7695-3136-6. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Active cancellation, Clean room, Space region, ANC, BSS and ICA, Entropy, Noise, Fuzzy, Gradient |
26 | Isidro B. Nieto, Refugio Vallejo |
A decision boundary hyperplane for the vector space of conics using a polinomial kernel in m-Euclidean space. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IJCNN ![In: Proceedings of the International Joint Conference on Neural Networks, IJCNN 2008, part of the IEEE World Congress on Computational Intelligence, WCCI 2008, Hong Kong, China, June 1-6, 2008, pp. 1273-1278, 2008, IEEE, 978-1-4244-1820-6. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
26 | Yingchao Zhao 0001, Shang-Hua Teng |
Combinatorial and Spectral Aspects of Nearest Neighbor Graphs in Doubling Dimensional and Nearly-Euclidean Spaces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TAMC ![In: Theory and Applications of Models of Computation, 4th International Conference, TAMC 2007, Shanghai, China, May 22-25, 2007, Proceedings, pp. 554-565, 2007, Springer, 978-3-540-72503-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
shallow minor, Fiedler value, metric embedding, Doubling dimension, neighborhood system |
26 | Jianer Chen, Yang Liu 0002, Songjian Lu |
An Improved Parameterized Algorithm for the Minimum Node Multiway Cut Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WADS ![In: Algorithms and Data Structures, 10th International Workshop, WADS 2007, Halifax, Canada, August 15-17, 2007, Proceedings, pp. 495-506, 2007, Springer, 978-3-540-73948-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
26 | Lyudmil Aleksandrov, Hristo N. Djidjev, Hua Guo, Anil Maheshwari, Doron Nussbaum, Jörg-Rüdiger Sack |
Approximate Shortest Path Queries on Weighted Polyhedral Surfaces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2006, 31st International Symposium, MFCS 2006, Stará Lesná, Slovakia, August 28-September 1, 2006, Proceedings, pp. 98-109, 2006, Springer, 3-540-37791-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
26 | Latife Genç Kaya, John N. Hooker |
A Filter for the Circuit Constraint. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CP ![In: Principles and Practice of Constraint Programming - CP 2006, 12th International Conference, CP 2006, Nantes, France, September 25-29, 2006, Proceedings, pp. 706-710, 2006, Springer, 3-540-46267-8. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
26 | Bin Fu, Zhixiang Chen 0001 |
Sublinear Time Width-Bounded Separators and Their Application to the Protein Side-Chain Packing Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAIM ![In: Algorithmic Aspects in Information and Management, Second International Conference, AAIM 2006, Hong Kong, China, June 20-22, 2006, Proceedings, pp. 149-160, 2006, Springer, 3-540-35157-4. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
26 | Alberto Tarable, Guido Montorsi, Sergio Benedetto |
A linear front end for iterative soft interference cancellation and decoding in coded CDMA. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Wirel. Commun. ![In: IEEE Trans. Wirel. Commun. 4(2), pp. 507-518, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
26 | Andrzej Lingas, Martin Wahlen |
Subexponential-Time Algorithms for Maximum Independent Set and Related Problems on Box Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 9th Annual International Conference, COCOON 2003, Big Sky, MT, USA, July 25-28, 2003, Proceedings, pp. 50-56, 2003, Springer, 3-540-40534-8. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
26 | Anil Maheshwari, Norbert Zeh |
I/O-optimal algorithms for planar graphs using separators. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, January 6-8, 2002, San Francisco, CA, USA., pp. 372-381, 2002, ACM/SIAM, 0-89871-513-X. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP BibTeX RDF |
|
26 | Hasan Davulcu, Saikat Mukherjee, Arvind Seth, I. V. Ramakrishnan |
CuTeX: a system for extracting data from text tables. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGIR ![In: SIGIR 2002: Proceedings of the 25th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, August 11-15, 2002, Tampere, Finland, pp. 457, 2002, ACM, 1-58113-561-0. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
26 | Sanjay Jain 0001, Frank Stephan 0001 |
Learning How to Separate. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALT ![In: Algorithmic Learning Theory, 12th International Conference, ALT 2001, Washington, DC, USA, November 25-28, 2001, Proceedings, pp. 219-234, 2001, Springer, 3-540-42875-5. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
26 | David W. Embley, Y. S. Jiang, Yiu-Kai Ng |
Record-Boundary Discovery in Web Documents. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGMOD Conference ![In: SIGMOD 1999, Proceedings ACM SIGMOD International Conference on Management of Data, June 1-3, 1999, Philadelphia, Pennsylvania, USA., pp. 467-478, 1999, ACM Press, 1-58113-084-8. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
HTML |
26 | Alon Efrat, Otfried Schwarzkopf |
Separating and Shattering Long Line Segments. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 7th International Symposium, ISAAC '96, Osaka, Japan, December 16-18, 1996, Proceedings, pp. 36-44, 1996, Springer, 3-540-62048-6. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
line-seperation, Computational Geometry, BSP-trees |
26 | Emmanuelle Garel |
On the Separators on an Infinite Word Generated by a Morphism. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 95, 12th Annual Symposium on Theoretical Aspects of Computer Science, Munich, Germany, March 2-4, 1995, Proceedings, pp. 119-130, 1995, Springer, 3-540-59042-0. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
Combinatoric on infinite words, q-regularity, circularity |
26 | Gabor T. Herman, K. T. Daniel Yeung |
On Piecewise-Linear Classification. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 14(7), pp. 782-786, 1992. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
tumor malignancy classification, piecewise-linear classification, breast cancer data, pattern recognition, computerised pattern recognition, medical computing, hyperplanes, patient diagnosis, patient diagnosis |
26 | Ondrej Sýkora, Imrich Vrto |
Edge Separators for Graphs of Bounded Genus with Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: 17th International Workshop, WG '91, Fischbachau, Germany, June 17-19, 1991, Proceedings, pp. 159-168, 1991, Springer, 3-540-55121-2. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
26 | Krzysztof Diks, Hristo N. Djidjev, Ondrej Sýkora, Imrich Vrto |
Edge Separators for Planar Graphs and Their Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 1988, MFCS'88, Carlsbad, Czechoslovakia, August 29 - September 2, 1988, Proceedings, pp. 280-290, 1988, Springer, 3-540-50110-X. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
|
21 | Eray Özkural, Bora Uçar, Cevdet Aykanat |
Parallel Frequent Item Set Mining with Selective Item Replication. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 22(10), pp. 1632-1640, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
frequent item set mining, selective data replication, graph partitioning by vertex separator, mining methods and algorithms, Parallel data mining |
21 | Avinatan Hassidim, Jonathan A. Kelner, Huy N. Nguyen, Krzysztof Onak |
Local Graph Partitions for Approximation and Testing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 50th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2009, October 25-27, 2009, Atlanta, Georgia, USA, pp. 22-31, 2009, IEEE Computer Society, 978-0-7695-3850-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
constant time algorithms, approximation algorithms, separator theorem |
21 | Fatemeh Razavi, Farhang Jalali-Farahani |
Ant Colony Optimization: A Leading Algorithm in Future Optimization of Petroleum Engineering Processes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICAISC ![In: Artificial Intelligence and Soft Computing - ICAISC 2008, 9th International Conference, Zakopane, Poland, June 22-26, 2008, Proceedings, pp. 469-478, 2008, Springer, 978-3-540-69572-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
History Matching, Ackley Function, Optimization, Separator, Ant Colony |
21 | Lorenzo Orecchia, Leonard J. Schulman, Umesh V. Vazirani, Nisheeth K. Vishnoi |
On partitioning graphs via single commodity flows. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 40th Annual ACM Symposium on Theory of Computing, Victoria, British Columbia, Canada, May 17-20, 2008, pp. 461-470, 2008, ACM, 978-1-60558-047-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
edge-separator, single-commodity max-flow, graph partitioning, spectral method, sparsest cut, matrix exponential |
21 | Costas Busch, Ryan LaFortune, Srikanta Tirthapura |
Improved sparse covers for graphs excluding a fixed minor. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, PODC 2007, Portland, Oregon, USA, August 12-15, 2007, pp. 61-70, 2007, ACM, 978-1-59593-616-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
minor free graph, path separator, sparse cover, planar graph, compact routing |
21 | Amit Agarwal, Moses Charikar, Konstantin Makarychev, Yury Makarychev |
O(sqrt(log n)) approximation algorithms for min UnCut, min 2CNF deletion, and directed cut problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing, Baltimore, MD, USA, May 22-24, 2005, pp. 573-581, 2005, ACM, 1-58113-960-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
directed balanced separator, directed sparsest cut, min 2CNF deletion, min UnCut, min multicut |
21 | M. Cemil Azizoglu, Ömer Egecioglu |
Lower Bounds on Communication Loads with Optimal Placements in Torus Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 49(3), pp. 259-266, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
edge separator, routing, interconnection network, placement, Torus, load, bisection |
21 | János Pach, Gábor Tardos |
On the boundary complexity of the union of fat triangles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 41st Annual Symposium on Foundations of Computer Science, FOCS 2000, 12-14 November 2000, Redondo Beach, California, USA, pp. 423-431, 2000, IEEE Computer Society, 0-7695-0850-2. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
boundary complexity, fat triangle union, separator line, computational complexity, computational geometry, computational geometry, upper bounds, motion planning, holes |
21 | Mohammod Abul Kashem, Xiao Zhou 0001, Takao Nishizeki |
An NC Parallel Algorithm for Generalized Vertex-Rankings of Partial k-Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISPAN ![In: 1997 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN '97), 18-20 December 1997, Taipei, Taiwan, pp. 105-111, 1997, IEEE Computer Society, 0-8186-8259-0. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
Separator tree, Vertex-ranking, Parallel algorithm, Treewidth, Partial k-tree |
21 | Alan M. Frieze, Ravi Kannan |
The Regularity Lemma and Approximation Schemes for Dense Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 37th Annual Symposium on Foundations of Computer Science, FOCS '96, Burlington, Vermont, USA, 14-16 October, 1996, pp. 12-20, 1996, IEEE Computer Society, 0-8186-7594-2. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
dense problems, polynomial time approximation, dense graphs, Graph Bisection problem, Min l-way cut problem, Graph Separator problem, Max-SNP hard problems, graph theory, approximation schemes, Quadratic Assignment Problem, regularity lemma, Max Cut problem |
21 | Gary L. Miller, Shang-Hua Teng, Stephen A. Vavasis |
A Unified Geometric Approach to Graph Separators ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 32nd Annual Symposium on Foundations of Computer Science, San Juan, Puerto Rico, 1-4 October 1991, pp. 538-547, 1991, IEEE Computer Society, 0-8186-2445-0. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
randomized NC algorithms, geometric embedding, randomized linear time algorithms, k-overlap graphs, k-nearest neighbor graphs, separator bound, finite element methods, planar graphs, graph separators |
19 | Abdullah Alsulieman, Xihe Ge, Zhiguo Zeng, Sergiy Butenko, Faisal Khan 0001, Mahmoud M. El-Halwagi |
Dynamic risk analysis of evolving scenarios in oil and gas separator. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Reliab. Eng. Syst. Saf. ![In: Reliab. Eng. Syst. Saf. 243, pp. 109834, March 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
19 | Vinicius de Vargas Terres, Marco Antonio Simoes Teixeira, Flávio Neves, Lúcia Valéria Ramos de Arruda, André Schneider de Oliveira |
Enhanced Optical Tracking of Weld Beads in Autonomous Inspection of Separator Vessels. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Robotics Autom. Lett. ![In: IEEE Robotics Autom. Lett. 9(1), pp. 167-174, January 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
19 | Xianlun Tang, Shifei Wang, Xin Deng 0003, Ke Liu 0008, Yin Tian, Huiming Wang 0002, Xinbo Gao 0001 |
Graph-Based Information Separator and Area Convolutional Network for EEG-Based Intention Decoding. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Cogn. Dev. Syst. ![In: IEEE Trans. Cogn. Dev. Syst. 16(1), pp. 212-222, February 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
19 | Boris Aronov, Mark de Berg, Leonidas Theocharous |
A Clique-Based Separator for Intersection Graphs of Geodesic Disks in R2. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2403.04905, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
19 | Tuukka Korhonen, Daniel Lokshtanov |
Induced-Minor-Free Graphs: Separator Theorem, Subexponential Algorithms, and Improved Hardness of Recognition. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, SODA 2024, Alexandria, VA, USA, January 7-10, 2024, pp. 5249-5275, 2024, SIAM, 978-1-61197-791-2. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
19 | Mengfan Ma, Ziyang Men, André Rossi, Yi Zhou 0016, Mingyu Xiao 0001 |
A vertex-separator-based integer linear programming formulation for the partitioned Steiner tree problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Oper. Res. ![In: Comput. Oper. Res. 153, pp. 106151, May 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
19 | Hongbing Ding, Zhengqi Chen, Hongjun Sun, Yan Yang, Zhenxin Liang, Yu Zhang |
Measurement of the Thin Liquid Film at the Wet-Gas Outlet of the Supersonic Separator by FPC Conductance Sensor. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Instrum. Meas. ![In: IEEE Trans. Instrum. Meas. 72, pp. 1-13, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
19 | Luc Jaulin |
Optimal separator for an ellipse; Application to localization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2305.10842, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
19 | Bart M. P. Jansen, Shivesh Kumar Roy |
On the Parameterized Complexity of Multiway Near-Separator. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2310.04332, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
19 | Jannik Irmai, Shengxian Zhao, Jannik Presberger, Bjoern Andres |
A Graph Multi-separator Problem for Image Segmentation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2307.04592, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
19 | Luc Jaulin |
Optimal separator for an hyperbola; Application to localization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2305.15519, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
19 | Lingwei Meng, Jiawen Kang, Mingyu Cui, Yuejiao Wang, Xixin Wu, Helen Meng |
A Sidecar Separator Can Convert a Single-Talker Speech Recognition System to a Multi-Talker One. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2302.09908, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
19 | Lingwei Meng, Jiawen Kang, Mingyu Cui, Haibin Wu, Xixin Wu, Helen Meng |
Unified Modeling of Multi-Talker Overlapped Speech Recognition and Diarization with a Sidecar Separator. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2305.16263, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
19 | Tuukka Korhonen, Daniel Lokshtanov |
Induced-Minor-Free Graphs: Separator Theorem, Subexponential Algorithms, and Improved Hardness of Recognition. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2308.04795, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
19 | Sándor Kisfaludi-Bak, Jana Masarikova, Erik Jan van Leeuwen, Bartosz Walczak, Karol Wegrzycki |
Separator Theorem and Algorithms for Planar Hyperbolic Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2310.11283, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
19 | Guilherme C. M. Gomes, Clément Legrand-Duchesne, Reem Mahmoud, Amer E. Mouawad, Yoshio Okamoto, Vinícius Fernandes dos Santos, Tom C. van der Zanden |
Minimum Separator Reconfiguration. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2307.07782, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
19 | Zhou Du, Yulin Ma, Quanyong Xu, Feng Wu |
Sand Discharge Simulation and Flow Path Optimization of a Particle Separator. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Entropy ![In: Entropy 25(1), pp. 147, January 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
19 | Kiagus Aufa Ibrahim, Prima Asmara Sejati, Panji Nursetia Darma, Akira Nakane, Masahiro Takei |
Metal Particle Detection by Integration of a Generative Adversarial Network and Electrical Impedance Tomography (GAN-EIT) for a Wet-Type Gravity Vibration Separator. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Sensors ![In: Sensors 23(19), pp. 8062, October 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
19 | Xinzhi Yu, Xuesong Jiang, Haiyang Gu, Fei Shen |
DEM Study of the Motion Characteristics of Rice Particles in the Indented Cylinder Separator. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Sensors ![In: Sensors 23(1), pp. 285, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
19 | Christopher T. Boughter, Martin Meier-Schellersheim |
An integrated approach to the characterization of immune repertoires using AIMS: An Automated Immune Molecule Separator. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PLoS Comput. Biol. ![In: PLoS Comput. Biol. 19(10), October 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
19 | Tai Liu, Ruizheng Jiang, Yuliang Cui, Xiuyu Chen, Hangjie Wu |
Modeling and simulation of marine oil separator based on Matlab. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCEIC ![In: 4th International Conference on Computer Engineering and Intelligent Control, ICCEIC 2023, Guangzhou, China, October 20-22, 2023, pp. 564-569, 2023, IEEE, 979-8-3503-0887-7. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
19 | Lingwei Meng, Jiawen Kang, Mingyu Cui, Yuejiao Wang, Xixin Wu, Helen Meng |
A Sidecar Separator Can Convert A Single-Talker Speech Recognition System to A Multi-Talker One. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICASSP ![In: IEEE International Conference on Acoustics, Speech and Signal Processing ICASSP 2023, Rhodes Island, Greece, June 4-10, 2023, pp. 1-5, 2023, IEEE, 978-1-7281-6327-7. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
19 | Samuel Baguley, Tobias Friedrich 0001, Aneta Neumann, Frank Neumann 0001, Marcus Pappik, Ziena Zeif |
Fixed Parameter Multi-Objective Evolutionary Algorithms for the W-Separator Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GECCO ![In: Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2023, Lisbon, Portugal, July 15-19, 2023, pp. 1537-1545, 2023, ACM. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
19 | Seddik Touhami, Mohammed Rezoug, Mohamed Maammar, Wessim Aksa, Karim Medles, Thami Zeghloul |
Optimization of the Geometry of a Free-Fall Separator Equipped with Two Flexible Electrodes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IAS ![In: IEEE Industry Applications Society Annual Meeting, IAS 2023, Nashville, TN, USA, October 29 - Nov. 2, 2023, pp. 1-6, 2023, IEEE, 979-8-3503-2016-9. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
19 | Anis Njeh, Ayad Ahmed Nour El Islam, Hafedh Trabelsi, Wafa Krika, Houari Boudjella, Najdib Kadri |
3D FEA of the Performances of Magnetic Separator for Different Drum Topologies. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SSD ![In: 20th International Multi-Conference on Systems, Signals & Devices, SSD 2023, Mahdia, Tunisia, February 20-23, 2023, pp. 429-432, 2023, IEEE, 979-8-3503-3256-8. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
19 | Emanuele Viola |
New Sampling Lower Bounds via the Separator. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 38th Computational Complexity Conference, CCC 2023, July 17-20, 2023, Warwick, UK, pp. 26:1-26:23, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-282-2. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
19 | Guilherme C. M. Gomes, Clément Legrand-Duchesne, Reem Mahmoud, Amer E. Mouawad, Yoshio Okamoto, Vinícius Fernandes dos Santos, Tom C. van der Zanden |
Minimum Separator Reconfiguration. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPEC ![In: 18th International Symposium on Parameterized and Exact Computation, IPEC 2023, September 6-8, 2023, Amsterdam, The Netherlands, pp. 9:1-9:12, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-305-8. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
19 | Bart M. P. Jansen, Shivesh Kumar Roy |
On the Parameterized Complexity of Multiway Near-Separator. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPEC ![In: 18th International Symposium on Parameterized and Exact Computation, IPEC 2023, September 6-8, 2023, Amsterdam, The Netherlands, pp. 28:1-28:18, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-305-8. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #100 of 432 (100 per page; Change: ) Pages: [ 1][ 2][ 3][ 4][ 5][ >>] |
|